Pagini recente » Cod sursa (job #2266363) | Cod sursa (job #2529587) | Cod sursa (job #2556877) | Cod sursa (job #561975) | Cod sursa (job #2266389)
#include <bits/stdc++.h>
#define DM 2000005
using namespace std;
ifstream fin("multiplu.in");
ofstream fout("multiplu.out");
queue<int>Q;
int lcm,a,b;
bool viz[DM];
int mp[DM];
char rez[DM];
void afis(int pos)
{
if(pos!=1)
afis(mp[pos]);
fout<<rez[pos];
}
int main()
{
fin>>a>>b;
lcm=a*b/__gcd(a,b);
Q.push(1);
rez[1]='1';
viz[1]=true;
while(!Q.empty()){
int curr=Q.front();
Q.pop();
int R0=(curr*10)%lcm;
int R1=(curr*10+1)%lcm;
if(viz[R0]) continue;
rez[R0]='0';
mp[R0]=curr;
if(R0==0)
break;
viz[R0]=true;
Q.push(R0);
if(viz[R1]) continue;
rez[R1]='1';
mp[R1]=curr;
if(R1==0)
break;
viz[R1]=true;
Q.push(R1);
}
afis(0);
return 0;
}