QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #817135 | #7029. Xu Xiake in Henan Province | SGColin | AC ✓ | 8ms | 3652kb | C++17 | 501b | 2024-12-16 20:35:56 | 2024-12-16 20:35:56 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
inline void work() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = (a > 0) + (b > 0) + (c > 0) + (d > 0);
if (ans == 0) cout << "Typically Otaku" << endl;
if (ans == 1) cout << "Eye-opener" << endl;
if (ans == 2) cout << "Young Traveller" << endl;
if (ans == 3) cout << "Excellent Traveller" << endl;
if (ans == 4) cout << "Contemporary Xu Xiake" << endl;
}
int main() {
int t; cin >> t;
while (t--) work();
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3644kb
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: 8ms
memory: 3652kb
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