# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41354 | 2018-02-16T18:48:57 Z | gabrielsimoes | Sequence (BOI14_sequence) | C++14 | 1000 ms | 68748 KB |
#include <bits/stdc++.h> using namespace std; bool test(int a, int b) { while (a > 0) { if (b == (a % 10)) return true; else a /= 10; } return false; } int n; vector<int> v; int main() { scanf("%d", &n); for (int i = 0, a; i < n; i++) { scanf("%d", &a); v.push_back(a); } // if (n <= 10000) { // for (int ans = 1; ans <= 10000; ans++) { // bool ok = true; // for (int i = 0; i < n; i++) { // if (!test(ans + i, v[i])) ok = false; // } // if (ok) { // printf("%d\n", ans); // return 0; // } // } // } int x = v[0]; int start = -1; for (int i = 1; i < 100000000; i++) { if (test(i, x)) { if (start == -1) start = i; if (i - start + 1 >= n) printf("%d\n", i); } else { start = -1; } } // if (x > 0 && x < 9) { // printf("%d", x); // int cur = 1; // while (n >= cur + 1) { // printf("0"); // cur *= 10; // } // printf("\n"); // } // if (x == 9) { // printf("9\n"); // } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1056 ms | 67788 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1075 ms | 67788 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1064 ms | 68748 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1088 ms | 68748 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |