Submission #2152570
Source Code Expand
#include <stdio.h>
int max(int x,int y){
if (x>y)return x;
else return y;
}
int min(int x,int y){
if(x>y)return y;
else return x;
}
int main(void){
int n;
scanf("%d",&n); //解答数の入手
char c[100];
scanf("%s",c); //解答の入手
int a1,a2,a3,a4;
a1=0;
a2=0;
a3=0;
a4=0;
for(int i=0;i<n;i++){
switch (c[i]){
case '1':
++a1;
break;
case '2':
++a2;
break;
case '3':
++a3;
break;
case '4':
++a4;
break;
default:
printf("default");
break;
}
}
/*printf("%d %d %d %d\n",a1,a2,a3,a4);*/ //デバッグ
int pmax=max(max(a1,a2),max(a3,a4));
int pmin=min(min(a1,a2),min(a3,a4));
printf("%d %d\n",pmax,pmin);
return 0;
}
Submission Info
Submission Time
2018-03-04 16:46:36+0900
Task
A - センター採点
User
tkc6022
Language
C (GCC 5.4.1)
Score
100
Code Size
1166 Byte
Status
AC
Exec Time
1 ms
Memory
128 KB
Compile Error
./Main.c: In function ‘main’:
./Main.c:16:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n); //解答数の入手
^
./Main.c:19:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s",c); //解答の入手
^
Judge Result
Set Name
All
Score / Max Score
100 / 100
Status
Set Name
Test Cases
All
00_sample1.txt, 00_sample2.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_all_1.txt, 02_all_2.txt, 02_all_3.txt, 02_all_4.txt, 03_mini_1.txt, 03_mini_2.txt, 03_mini_3.txt, 03_mini_4.txt
Case Name
Status
Exec Time
Memory
00_sample1.txt
AC
0 ms
128 KB
00_sample2.txt
AC
1 ms
128 KB
01_rnd_00.txt
AC
1 ms
128 KB
01_rnd_01.txt
AC
0 ms
128 KB
01_rnd_02.txt
AC
0 ms
128 KB
01_rnd_03.txt
AC
0 ms
128 KB
01_rnd_04.txt
AC
1 ms
128 KB
01_rnd_05.txt
AC
0 ms
128 KB
01_rnd_06.txt
AC
0 ms
128 KB
01_rnd_07.txt
AC
0 ms
128 KB
01_rnd_08.txt
AC
1 ms
128 KB
01_rnd_09.txt
AC
0 ms
128 KB
01_rnd_10.txt
AC
1 ms
128 KB
01_rnd_11.txt
AC
0 ms
128 KB
01_rnd_12.txt
AC
1 ms
128 KB
01_rnd_13.txt
AC
0 ms
128 KB
01_rnd_14.txt
AC
1 ms
128 KB
01_rnd_15.txt
AC
0 ms
128 KB
01_rnd_16.txt
AC
0 ms
128 KB
01_rnd_17.txt
AC
1 ms
128 KB
01_rnd_18.txt
AC
0 ms
128 KB
01_rnd_19.txt
AC
1 ms
128 KB
02_all_1.txt
AC
0 ms
128 KB
02_all_2.txt
AC
1 ms
128 KB
02_all_3.txt
AC
0 ms
128 KB
02_all_4.txt
AC
0 ms
128 KB
03_mini_1.txt
AC
1 ms
128 KB
03_mini_2.txt
AC
1 ms
128 KB
03_mini_3.txt
AC
1 ms
128 KB
03_mini_4.txt
AC
0 ms
128 KB