Pagini recente » Cod sursa (job #1889579) | Cod sursa (job #489592) | Cod sursa (job #1326109) | Cod sursa (job #524001) | Cod sursa (job #1789655)
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
long long int n, m, i, j, mu, _cf, mult, cmult, op;
bool cf[10]={0}, mf;
int main()
{
ifstream f("valori.in");
ofstream g("valori.out");
f>>n>>m;
for(i=1;i<=m;i++){
f>>_cf;
cf[_cf]=true;
}
mf=true;
mult=n*2;
while(mf && op<20000000 && mult<INT_MAX){
cmult=mult;
mf=false;
while(mult>0){
++op;
_cf=mult%10;
mult/=10;
if(!cf[_cf]){
mf=true;
break;
}
}
mult=cmult+n;
while(!cf[mult%10] && mult<INT_MAX)
mult+=n;
}
if(mf)
cmult=0;
g<<cmult<<"\n";
}