Pagini recente » Cod sursa (job #3145178) | Cod sursa (job #795355) | Cod sursa (job #1161891) | Cod sursa (job #353413) | Cod sursa (job #926635)
Cod sursa(job #926635)
#include<cstdio>
using namespace std;
int u,p;
bool v[2000000];
struct queue
{
int r,t;
bool c;
};
queue q[2000010];
void afisare()
{
int j,k;
k=0;
while(u>0)
{
v[++k]=q[u].c;
u=q[u].t;
}
for(j=k;j>0;j--) printf("%d",v[j]);
printf("\n");
}
int main()
{
freopen("multiplu.in","r",stdin);
freopen("multiplu.out","w",stdout);
int ai,bi,a,b,cmmmc,r;
scanf("%d%d",&a,&b);
ai=a;
bi=b;
while(r)
{
r=a%b;
a=b;
b=r;
}
cmmmc=ai*bi/a;
p=1;
u=1;
q[1].c=1;
q[1].r=1;
q[1].t=0;
for(p=1;p;p++)
{
q[++u].c=0;
q[u].r=(q[p].r*10+q[u].c)%cmmmc;
q[u].t=p;
if(q[u].r==0) {afisare();
break;}
q[++u].c=1;
q[u].r=(q[p].r*10+q[u].c)%cmmmc;
q[u].t=p;
if(q[u].r==0) {afisare();
break;}
}
return 0;
}