Submission #4209
Source Code Expand
#include <cstdio> #include <cstring> #include <cmath> #include <map> #include <set> #include <queue> #include <string> #include <iostream> #include <algorithm> #include <functional> using namespace std; typedef pair<int, int> P; typedef long long ll; #define A first #define B second #define pb(x) push_back(x) #define SIZE(x) x.size() const int inf = 0x7fffffff; int score[4]; int main(void) { char str[105]; int n; scanf("%d%s",&n,str); for(int i = 0;i < n;i++) score[str[i]-'1']++; printf("%d %d\n",max(max(score[0],score[1]),max(score[2],score[3])), min(min(score[0],score[1]),min(score[2],score[3]))); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - センター採点 |
User | igrsk |
Language | C++ (GCC 4.4.7) |
Score | 100 |
Code Size | 666 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 688 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result
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 | 19 ms | 128 KB |
00_sample2.txt | AC | 19 ms | 128 KB |
01_rnd_00.txt | AC | 19 ms | 128 KB |
01_rnd_01.txt | AC | 18 ms | 128 KB |
01_rnd_02.txt | AC | 19 ms | 668 KB |
01_rnd_03.txt | AC | 19 ms | 128 KB |
01_rnd_04.txt | AC | 19 ms | 128 KB |
01_rnd_05.txt | AC | 18 ms | 128 KB |
01_rnd_06.txt | AC | 19 ms | 128 KB |
01_rnd_07.txt | AC | 20 ms | 128 KB |
01_rnd_08.txt | AC | 20 ms | 128 KB |
01_rnd_09.txt | AC | 19 ms | 128 KB |
01_rnd_10.txt | AC | 19 ms | 128 KB |
01_rnd_11.txt | AC | 19 ms | 128 KB |
01_rnd_12.txt | AC | 19 ms | 688 KB |
01_rnd_13.txt | AC | 19 ms | 128 KB |
01_rnd_14.txt | AC | 19 ms | 128 KB |
01_rnd_15.txt | AC | 19 ms | 128 KB |
01_rnd_16.txt | AC | 19 ms | 128 KB |
01_rnd_17.txt | AC | 20 ms | 128 KB |
01_rnd_18.txt | AC | 20 ms | 128 KB |
01_rnd_19.txt | AC | 19 ms | 128 KB |
02_all_1.txt | AC | 21 ms | 128 KB |
02_all_2.txt | AC | 19 ms | 128 KB |
02_all_3.txt | AC | 18 ms | 128 KB |
02_all_4.txt | AC | 19 ms | 128 KB |
03_mini_1.txt | AC | 19 ms | 128 KB |
03_mini_2.txt | AC | 19 ms | 128 KB |
03_mini_3.txt | AC | 19 ms | 128 KB |
03_mini_4.txt | AC | 19 ms | 128 KB |