Pagini recente » Cod sursa (job #1043331) | Cod sursa (job #2868767) | Cod sursa (job #1076728) | Cod sursa (job #2813555) | Cod sursa (job #1540254)
#include <cstdio>
#include <queue>
using namespace std;
queue <int> q;
int cmmdc(int a,int b)
{
int r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int cmmmc(int a,int b)
{
int prod=a*b;
int M=cmmdc(a,b);
return prod/M;
}
int lee(int m)
{
int nr=1;
q.push(nr);
while(!q.empty())
{
nr=q.front();
int nr2=nr*10+1,nr1=nr*10;
if(nr1%m==0)
return nr1;
if(nr2%m==0)
return nr2;
q.push(nr1);
q.push(nr2);
q.pop();
}
}
int main()
{
int a,b;
freopen("multiplu.in","r",stdin);
freopen("multiplu.out","w",stdout);
scanf("%d%d",&a,&b);
int m=cmmmc(a,b);
printf("%d",lee(m));
return 0;
}