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>
#include <string>
using namespace std;
bool is_in(int x,int y)
{
string s=to_string(x);
string yp="";
yp+=char(y+'0');
return s.find(yp)!=string::npos;
}
int main()
{
int n;
cin>>n;
int b[n];
for(int i=0;i<n;i++)
cin>>b[i];
for(int ans=1;ans<=1e6;ans++)
{
bool pos=1;
for(int j=0;j<n;j++)
{
if(!is_in(ans+j,b[j]))
{
pos=0;
break;
}
}
if(pos)
{
cout<<ans<<endl;
break;
}
}
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... |