Pagini recente » Cod sursa (job #852923) | Cod sursa (job #2475903) | Cod sursa (job #2193665) | Profil LauraAb. | Cod sursa (job #2627682)
#include <fstream>
#include <algorithm>
#include <queue>
using namespace std;
ifstream cin("multiplu.in");
ofstream cout("multiplu.out");
int a,b,m,t,viz[2000005],ans;
queue <int> q;
int main()
{
cin>>a>>b;
m=a*b/__gcd(a,b);
if(1%m==0){
cout<<1;
return 0;
}
else{
viz[1%m]=1;
}
q.push(1);
while(!q.empty()){
t=q.front();
q.pop();
if(viz[(t*10)%m]==0){
viz[(t*10)%m]=1;
if((t*10)%m==0){
ans=t*10;
break;
}
else{
q.push(t*10);
}
}
if(viz[(t*10+1)%m]==0){
viz[(t*10+1)%m]=1;
if((t*10+1)%m==0){
ans=t*10+1;
break;
}
else{
q.push(t*10+1);
}
}
}
cout<<ans;
return 0;
}