# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
208863 | 2020-03-12T11:02:11 Z | Sensei | Go (COCI16_go) | C++14 | 5 ms | 376 KB |
/* DATE: 2020-03-12 13:53:43 NAME: PROBLEM: COCI16_GO */ #include <bits/stdc++.h> using namespace std; const int MAXN = 70; int k[MAXN + 7]; int m[MAXN + 7]; string st[MAXN + 7]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> st[i]; scanf("%d %d", &k[i], &m[i]); } int ansv = -1; string ans; int ansc = 0; for (int i = 1; i <= n; i++) { int cnt = 0; while (m[i] >= k[i]) { m[i] -= k[i]; m[i] += 2; cnt++; } if (cnt > ansv) { ansv = cnt; ans = st[i]; } ansc += cnt; } cout << ansc << "\n" << ans << "\n"; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 4 ms | 256 KB | Output is correct |
3 | Correct | 4 ms | 256 KB | Output is correct |
4 | Correct | 4 ms | 256 KB | Output is correct |
5 | Correct | 5 ms | 256 KB | Output is correct |
6 | Correct | 5 ms | 256 KB | Output is correct |
7 | Correct | 5 ms | 256 KB | Output is correct |
8 | Correct | 4 ms | 376 KB | Output is correct |
9 | Correct | 4 ms | 256 KB | Output is correct |
10 | Correct | 5 ms | 256 KB | Output is correct |
11 | Correct | 5 ms | 376 KB | Output is correct |
12 | Correct | 5 ms | 256 KB | Output is correct |
13 | Correct | 5 ms | 376 KB | Output is correct |
14 | Correct | 5 ms | 376 KB | Output is correct |
15 | Correct | 5 ms | 256 KB | Output is correct |
16 | Correct | 5 ms | 256 KB | Output is correct |
17 | Correct | 5 ms | 256 KB | Output is correct |
18 | Correct | 5 ms | 256 KB | Output is correct |
19 | Correct | 5 ms | 256 KB | Output is correct |
20 | Correct | 5 ms | 376 KB | Output is correct |
21 | Correct | 5 ms | 256 KB | Output is correct |
22 | Correct | 5 ms | 376 KB | Output is correct |
23 | Correct | 5 ms | 376 KB | Output is correct |
24 | Correct | 5 ms | 256 KB | Output is correct |
25 | Correct | 5 ms | 376 KB | Output is correct |