Pagini recente » Cod sursa (job #1490975) | Cod sursa (job #2894681) | Cod sursa (job #2635827) | Cod sursa (job #1331399) | Cod sursa (job #1827178)
#include <cstdio>
using namespace std;
struct lee
{
int nr,rest;
};
lee q[200000];
int main()
{
freopen("multiplu.in","r",stdin);
freopen("multiplu.out","w",stdout);
int a, b , rest,prod=1;
scanf("%d %d",&a,&b);
prod=a*b;
while(b)
{
rest=a%b;
a=b;
b=rest;
}
prod/=a;
if(prod==1)
{
printf("1");
return 0;
}
int p =1, u =1;
q[1].nr=1;
q[1].rest=1;
while(p<=u)
{
int nr1=q[p].nr,rest1=q[p].rest;p++;
for(int i = 0 ; i <= 1;i++)
{
q[++u].nr=nr1*10+i;
q[u].rest=(rest1*10+i)%prod;
if(q[u].rest==0)
{
printf("%d",q[u].nr);
return 0;
}
}
}
return 0;
}