QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #656335 | #7029. Xu Xiake in Henan Province | veg# | AC ✓ | 2ms | 3804kb | C++14 | 439b | 2024-10-19 12:25:19 | 2024-10-19 12:25:20 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
int x, y, z, w;
scanf("%d %d %d %d", &x, &y, &z, &w);
int s = (x > 0) + (y > 0) + (z > 0) + (w > 0);
if (s == 0) puts("Typically Otaku");
else if (s == 1) puts("Eye-opener");
else if (s == 2) puts("Young Traveller");
else if (s == 3) puts("Excellent Traveller");
else puts("Contemporary Xu Xiake");
}
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3660kb
input:
5 0 0 0 0 0 0 0 1 1 1 0 0 2 1 1 0 1 2 3 4
output:
Typically Otaku Eye-opener Young Traveller Excellent Traveller Contemporary Xu Xiake
result:
ok 5 lines
Test #2:
score: 0
Accepted
time: 2ms
memory: 3804kb
input:
10000 0 3 0 0 0 0 1 0 0 0 0 0 0 3 0 22 0 3 0 2 2 0 0 0 9 0 6 37 0 0 0 0 9 2 0 0 1 0 0 0 0 0 5 1 3 6 0 0 2 3 8 0 0 3 0 1 0 25 0 2 0 2 0 0 3 0 0 0 3 13 0 6 0 0 0 3 0 0 28 0 0 0 3 1 21 32 0 0 2 0 0 0 45 0 0 12 4 0 0 0 0 0 0 6 0 0 0 0 24 0 3 0 0 5 28 0 1 10 10 2 0 7 0 0 3 1 24 1 2 2 0 78 0 0 41 0 6 4 0 ...
output:
Eye-opener Eye-opener Typically Otaku Young Traveller Young Traveller Eye-opener Excellent Traveller Typically Otaku Young Traveller Eye-opener Young Traveller Young Traveller Excellent Traveller Young Traveller Young Traveller Eye-opener Eye-opener Excellent Traveller Eye-opener Eye-opener Young Tr...
result:
ok 10000 lines