Submission #1752550

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priotity_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,m,a;
bool li[15]={};

int main(){
	cin >> n >> m;
	REP(i,0,m) cin >> a,li[a]=true;
	
	REP(i,n,n*10+1){
		string w=to_string(n);
		bool f=true;
		
		REP(i,0,w.size()) if(li[w[i]-'0']) f=false;
		
		if(f) break;
		n++;
	}
	
	cout << n << endl;
	return 0;
}

Submission Info

Judge Result