This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |