Submission #105647

#TimeUsernameProblemLanguageResultExecution timeMemory
105647pamajSequence (BOI14_sequence)C++14
9 / 100
1090 ms108252 KiB
#include <bits/stdc++.h> using namespace std; #define int int_fast32_t const int maxn = 1e7 + 10, maxm = 1e5 + 10; bool num[maxn][11]; int n, v[maxm]; int32_t main() { ios::sync_with_stdio(false), cin.tie(nullptr); num[0][0] = true; for(int i = 1; i < maxn; i++) { int p = i; while(p) { num[i][p%10] = true; p /= 10; } } cin >> n; for(int i = 0; i < n; i++) { cin >> v[i]; } for(int i = 1; i < maxn - n - 1; i++) { bool ok = true; for(int j = 0; j < n; j++) { if(num[i + j][v[j]] == false) ok = false; } if(ok) { cout << i << "\n"; return 0; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...