# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
41351 | 2018-02-16T18:45:51 Z | gabrielsimoes | 수열 (BOI14_sequence) | C++14 | 368 ms | 15612 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; } } } else { int x = v[0]; int start = -1; for (int i = 1; i < 10000000; 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 248 KB | Output is correct |
2 | Correct | 5 ms | 352 KB | Output is correct |
3 | Correct | 1 ms | 552 KB | Output is correct |
4 | Correct | 2 ms | 552 KB | Output is correct |
5 | Correct | 1 ms | 552 KB | Output is correct |
6 | Correct | 1 ms | 584 KB | Output is correct |
7 | Correct | 2 ms | 584 KB | Output is correct |
8 | Correct | 8 ms | 584 KB | Output is correct |
9 | Correct | 1 ms | 584 KB | Output is correct |
10 | Correct | 3 ms | 604 KB | Output is correct |
11 | Correct | 2 ms | 604 KB | Output is correct |
12 | Correct | 1 ms | 604 KB | Output is correct |
13 | Correct | 2 ms | 604 KB | Output is correct |
14 | Correct | 14 ms | 604 KB | Output is correct |
15 | Correct | 13 ms | 620 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 620 KB | Output is correct |
2 | Correct | 5 ms | 620 KB | Output is correct |
3 | Correct | 1 ms | 620 KB | Output is correct |
4 | Correct | 2 ms | 620 KB | Output is correct |
5 | Correct | 1 ms | 620 KB | Output is correct |
6 | Correct | 1 ms | 620 KB | Output is correct |
7 | Correct | 76 ms | 620 KB | Output is correct |
8 | Correct | 2 ms | 620 KB | Output is correct |
9 | Correct | 9 ms | 620 KB | Output is correct |
10 | Correct | 1 ms | 620 KB | Output is correct |
11 | Incorrect | 90 ms | 620 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 620 KB | Output is correct |
2 | Incorrect | 368 ms | 15612 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 15612 KB | Output is correct |
2 | Correct | 6 ms | 15612 KB | Output is correct |
3 | Correct | 1 ms | 15612 KB | Output is correct |
4 | Correct | 2 ms | 15612 KB | Output is correct |
5 | Incorrect | 271 ms | 15612 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |