Submission #2710848
Source Code Expand
/*
AtCoder Beginner Contest 010 A - ハンドルネーム
結果:
*/
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#define max(x,y)(x<y?y:x)
#define int long long
int compare(const void *a, const void *b) {
return *(int*)b - *(int*)a;
}
//尺取法
//scanf("%d", &N);
//for (i; i < N; ++i) {
// scanf("%d", &A[i]);
// if (b[A[i]] == 1) {
// ans = max(ans, i - j);
// while (b[A[i]] == 1) {
// b[A[j++]] = 0;
// }
// }
// b[A[i]] = 1;
//}
//ans = max(ans, i - j);
//printf("%d\n", ans);
//文字列の最大出現
//static int N, i, j, ans;
//static int A, B;
//static char A[50][51];
//static int cnt, max;
//char *max_name;
//
//scanf("%d", &N);
//for (i = 0; i < N; i++) {
// scanf("%s", A[i]);
//}
//max_name = A[0];
//for (i = 0; i < N; i++) {
// cnt = 0;
// for (j = 0; j < N; j++) {
// if (strcmp(A[i], A[j]) == 0) {
// cnt++;
// }
// if (cnt > max) {
// max = cnt;
// max_name = A[i];
// }
// }
//}
//printf("%s\n", max_name);
//#define DEBUG1
//#define DEBUG2
//#define DEBUGF
int main() {
static int N, i, j;
//static int AN, BN, A[100] = {}, B[100] = {}, i, j, ans;
//static int A, B;
//static int A, B, C;
//static int a[31] = {}, b[31] = {}, cnt = 0;
//static char A[50][51];
//static int cnt, max;
//char *max_name;
//static int ans;
static char A[13];
static char ans;
//char str1[256];
//scanf("%s", str1);
//scanf("%s", A);
//for (i = 0; i < A; i++) {
// scanf("%c", &A[i]);
//}
scanf("%s", A);
//ans = cnt;
//qsort(A, N, sizeof(int), compare);
//ans = ;
//printf("%d\n", ans);
printf("%spp\n", A);
#ifdef DEBUGF
getch();
#endif
return 0;
}
Submission Info
Submission Time
2018-06-21 21:10:30+0900
Task
A - ハンドルネーム
User
chonerie
Language
C (GCC 5.4.1)
Score
100
Code Size
1738 Byte
Status
AC
Exec Time
0 ms
Memory
128 KB
Compile Error
./Main.c: In function ‘main’:
./Main.c:84:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s", A);
^
Judge Result
Set Name
All
Score / Max Score
100 / 100
Status
Set Name
Test Cases
All
sample_01.txt, sample_02.txt, test_aaaaaaaaaa.txt, test_myonmyon.txt, test_nemui.txt, test_onakasuita.txt, test_p.txt
Case Name
Status
Exec Time
Memory
sample_01.txt
AC
0 ms
128 KB
sample_02.txt
AC
0 ms
128 KB
test_aaaaaaaaaa.txt
AC
0 ms
128 KB
test_myonmyon.txt
AC
0 ms
128 KB
test_nemui.txt
AC
0 ms
128 KB
test_onakasuita.txt
AC
0 ms
128 KB
test_p.txt
AC
0 ms
128 KB