Pagini recente » Cod sursa (job #878921) | Cod sursa (job #1422120) | Cod sursa (job #1159220) | Cod sursa (job #1538300) | Cod sursa (job #1901042)
#include<bits/stdc++.h>
using namespace std;
int dv,v[2000005],a,b,m,q[2000005],cif[2000005],pre[2000005],seen[2000005],st,dr,nr,rest1,rest2;
int cmmmc(int a,int b)
{
int x=a,y=b;
int r=a%b;
while(r)
{
a=b;b=r;
r=a%b;
}
return (x*y/b);
}
void BuildSol(int dr)
{
if(dr==1)
{
v[++dv]=1;
return;
}
v[++dv]=cif[dr];
BuildSol(pre[dr]);
}
void afisare()
{
for(int i=dv;i>=1;i--) printf("%d",v[i]);
printf("\n");
}
int main()
{
freopen("multiplu.in","r",stdin);
freopen("multiplu.out","w",stdout);
scanf("%d%d",&a,&b);
m=cmmmc(a,b);
cif[1]=1;
q[1]=1;
seen[1]=1;
st=1;
dr=2;
while(st<dr)
{
nr=q[st];
rest1=(10*nr)%m;
rest2=(10*nr+1)%m;
if(!seen[rest1])
{
q[dr]=rest1;
seen[rest1]=1;
cif[dr]=0;
pre[dr]=st;
if(!q[dr])
{
BuildSol(dr);
afisare();
return 0;
}
dr++;
}
if(!seen[rest2])
{
q[dr]=rest2;
seen[rest2]=1;
cif[dr]=1;
pre[dr]=st;
if(!q[dr])
{
BuildSol(dr);
afisare();
return 0;
}
dr++;
}
seen[q[st]]=0;
st++;
}
return 0;
}