# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
38584 | 2018-01-04T14:00:28 Z | Waschbar | Sequence (BOI14_sequence) | C++14 | 19 ms | 2052 KB |
#include <bits/stdc++.h> using namespace std; int k; int a[10000]; bool check(int x, int y) { if(x == 0) return (x == y); while(x > 0) { if(x%10 == y) return 1; x /= 10; } return 0; } int main() { cin >> k; bool indd = 1; for(int i = 1; i <= k; i++) { cin >> a[i]; if(i > 1 && a[i-1] != a[i]) indd = 0; } if(indd) { int K, x, ans; x = a[1]; K = k; if(k == 1){ if(x == 0) cout << 10; else cout << x; return 0; } ans = 1; while(k > 0){ k /= 10; ans *= 10; } if(x != 0) ans *= x; int cnt = 0; int pp = ans; if(x == 9){ ans = 88; cnt = 11; k =K; while(cnt < k){ cnt *= 10; cnt++; ans *= 10; ans += 8; } ans++; } if(x==0) ans *= 10; cout << ans; return 0; } for(int i = 1; i <= 1000; i++) { bool ind = 1; for(int j = 1; j <= k; j++){ if(!check(i+j-1,a[j])) ind = 0; } if(ind){ cout << i; return 0; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2052 KB | Output is correct |
2 | Correct | 3 ms | 2052 KB | Output is correct |
3 | Correct | 0 ms | 2052 KB | Output is correct |
4 | Correct | 0 ms | 2052 KB | Output is correct |
5 | Correct | 0 ms | 2052 KB | Output is correct |
6 | Correct | 0 ms | 2052 KB | Output is correct |
7 | Correct | 0 ms | 2052 KB | Output is correct |
8 | Correct | 9 ms | 2052 KB | Output is correct |
9 | Correct | 0 ms | 2052 KB | Output is correct |
10 | Correct | 0 ms | 2052 KB | Output is correct |
11 | Correct | 0 ms | 2052 KB | Output is correct |
12 | Correct | 0 ms | 2052 KB | Output is correct |
13 | Correct | 0 ms | 2052 KB | Output is correct |
14 | Correct | 13 ms | 2052 KB | Output is correct |
15 | Correct | 19 ms | 2052 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2052 KB | Output is correct |
2 | Correct | 3 ms | 2052 KB | Output is correct |
3 | Correct | 0 ms | 2052 KB | Output is correct |
4 | Correct | 0 ms | 2052 KB | Output is correct |
5 | Correct | 0 ms | 2052 KB | Output is correct |
6 | Correct | 0 ms | 2052 KB | Output is correct |
7 | Incorrect | 9 ms | 2052 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2052 KB | Output is correct |
2 | Incorrect | 0 ms | 2052 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2052 KB | Output is correct |
2 | Correct | 3 ms | 2052 KB | Output is correct |
3 | Correct | 0 ms | 2052 KB | Output is correct |
4 | Correct | 0 ms | 2052 KB | Output is correct |
5 | Incorrect | 0 ms | 2052 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |