Pagini recente » Cod sursa (job #614729) | Cod sursa (job #498615) | Cod sursa (job #140107) | Cod sursa (job #2597195) | Cod sursa (job #532247)
Cod sursa(job #532247)
#include<cstdio>
struct queue
{
int c;
int r;
int t;
};
queue q[10000];
int v[10000];
int main()
{
freopen("multiplu.in","r",stdin);
freopen("multiplu.out","w",stdout);
int n,a,b,i=1,j,k;
scanf("%d%d",&a,&b);
n=a*b;
q[1].c=1;
q[1].r=1;
q[1].t=0;
j=1;
while(1)
{
q[++i].c=0;
q[i].t=j;
q[i].r=(q[q[i].t].r*10+q[i].c)%n;
if(q[i].r==0)
break;
q[++i].c=1;
q[i].t=j;
q[i].r=(q[q[i].t].r*10+q[i].c)%n;
if(q[i].r==0)
break;
++j;
}
k=i;
for(j=1;;++j)
{
v[j]=q[k].c;
k=q[k].t;
if(k==0)
break;
}
for(i=1;i<=j;++i)
printf("%d",v[i]);
return 0;
}