Pagini recente » Cod sursa (job #239948) | Cod sursa (job #2311432) | Cod sursa (job #1628165) | Cod sursa (job #3124968) | Cod sursa (job #711348)
Cod sursa(job #711348)
#include <iostream>
#include <fstream>
#include <queue>
#include <string>
#include <set>
using namespace std;
int a,b,m,mm[2000005];
queue<string> c;
int cmmdc(int a, int b) {
int c;
for(;b;) {
c=a%b;
a=b;
b=c;
}
return a;
}
int mod(string s, int a) {
int r=0;
for(int i=0; i<s.size(); ++i) {
r=r*10+s[i]-'0';
r=r%a;
}
return r;
}
int main()
{
ifstream f("multiplu.in");
ofstream g("multiplu.out");
f>>a>>b;
m=(a*b)/cmmdc(a,b);
for(c.push("1");c.size(); c.pop()) {
string fr=c.front();
int md=mod(fr,m);
if(mm[md]) continue;
mm[md]=1;
if(md==0) {
g<<fr;
return 0;
}
c.push(fr+"0");
c.push(fr+"1");
}
return 0;
}