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 pb push_back
#define mp make_pair
#define fir first
#define sec second
typedef long long ll;
using namespace std;
int n;
int arr[1005] = {0};
bool check(int x,int d)
{
while(x>0)
{
if(x%10==d) return true;
x/=10;
}
return false;
}
bool tryposs(int curr)
{
for(int i=0;i<n;i++)
{
if(check(curr+i,arr[i])==false) return false;
}
return true;
}
void solve()
{
cin >> n;
for(int i=0;i<n;i++) cin >> arr[i];
for(int i=1;i<=1000;i++)
{
if(tryposs(i))
{
cout << i << endl;
return;
}
}
return;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int tc=1;
//cin>>tc;
for(int i=1;i<=tc;i++) 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... |