Pagini recente » Cod sursa (job #1983099) | Cod sursa (job #2658701) | Cod sursa (job #1371965) | Cod sursa (job #1204462) | Cod sursa (job #593110)
Cod sursa(job #593110)
#include<stdio.h>
#define LMAX 2000000 + 2012
struct pozdy
{
int c,r,last;
} q[LMAX];
bool f[LMAX];
void print(int x)
{
if(q[x].last==0)
{
printf("1");
return;
}
print(q[x].last);
printf("%d",q[x].c);
}
int main()
{
int A,B,r,a,b,C,c;
freopen("multiplu.in","r",stdin);
freopen("multiplu.out","w",stdout);
scanf("%d%d",&A,&B);
a=A; b=B;
while(b)
{
r=a%b;
a=b;
b=r;
}
C=A*B/a;
int p,u,val; p=u=1;
q[1].c=1; q[1].r=1; q[1].last=0; f[1]=1;
while(p<=u)
{
for(c=0;c<=1;c++)
{
val=(q[p].r*10+c)%C;
if(!f[val])
{
f[val]=1;
q[++u].c=c; q[u].r=val; q[u].last=p;
if(val==0)
{
print(u);
return 0;
}
}
}
p++;
}
return 0;
}