Submission #107676

#TimeUsernameProblemLanguageResultExecution timeMemory
107676dfistricSequence (BOI14_sequence)C++14
9 / 100
15 ms640 KiB
#include <bits/stdc++.h> #define FOR(i, a, b) for (int i = (a); i < (b); i++) #define FORd(i, a, b) for (int i = (a); i >= (b); i--) #define REP(i, n) FOR(i, 0, n) #define ll long long using namespace std; const int MAXN = 100100; ll arr[MAXN]; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; REP(i, n) cin >> arr[i]; if (n <= 1000) { REP(k, 1001) { int good = 1; REP(i, n) { int flag = 0, t = k + i; while (t > 0) { if (t % 10 == arr[i]) flag = 1; t /= 10; } if (!flag) good = 0; } if (good) { cout << k << "\n"; return 0; } } } if (arr[0] != 9) { n--; ll t = 1LL; while (t < n) t *= 10LL; if (n == 0) t *= 10; if (arr[0] == 0) cout << 10LL * t << "\n"; else cout << arr[0] * t << "\n"; } else { ll out = 8LL, curr = 1LL, inc = 10LL; while (curr < n) { curr += inc; out = out * 10LL + 8LL; inc *= 10LL; } cout << out + 1 << "\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...