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 <iostream>
using namespace std;
int N, A[100001], ans = 0;
int main()
{
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
for (int i = 1; i <= 1000; i++)
{
for (int j = 0; j < N; j++)
{
int c = i + j;
bool exist = 0;
while (c) {exist |= (A[j] == c % 10); c /= 10;}
if (!exist) {break;}
else if (j == N - 1) {ans = i;}
}
if (ans) break;
}
cout << ans << "\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... |