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>
using namespace std;
#ifdef DEBUG
#include "debug.h"
#else
#define debug(...) 0
#endif
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define pb push_back
#define i2 array<int, 2>
#define ll long long
const int N = 1e5 + 4;
int k, b[N];
bool have(int x, int d) {
while (x) {
if (x % 10 == d) {
return 1;
}
x /= 10;
}
return 0;
}
void solve() {
cin >> k;
for (int i = 0; i < k; i++) {
cin >> b[i];
}
int n = 1;
while (1) {
bool ok = 1;
if (have(n + k - 1, b[k - 1])) {
for (int j = 0; j < k; j++) ok &= have(n + j, b[j]);
if (ok) {
cout << n;
return;
}
}
n++;
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
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... |