Pagini recente » Cod sursa (job #1803713) | Cod sursa (job #2573035) | Cod sursa (job #2823736) | Cod sursa (job #1878094) | Cod sursa (job #711350)
Cod sursa(job #711350)
#include <iostream>
#include <fstream>
#include <queue>
#include <string>
#include <set>
using namespace std;
int a,b,m,mm[2000005];
queue<pair<string,int> > c;
int cmmdc(int a, int b) {
int c;
for(;b;) {
c=a%b;
a=b;
b=c;
}
return a;
}
int main()
{
ifstream f("multiplu.in");
ofstream g("multiplu.out");
f>>a>>b;
m=(a*b)/cmmdc(a,b);
for(c.push(make_pair("1",1));c.size(); c.pop()) {
string fr=c.front().first;
int mc=c.front().second;
if(mm[mc]) continue;
mm[mc]=1;
if(mc==0) {
g<<fr;
return 0;
}
int md=(mc*10)%m;
c.push(make_pair(fr+"0",md));
c.push(make_pair(fr+"1",(md+1)%m));
}
return 0;
}