Pagini recente » Cod sursa (job #52819) | Cod sursa (job #2575617) | Cod sursa (job #2901679) | Cod sursa (job #2297978) | Cod sursa (job #3121997)
#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream fin("multiplu.in");
ofstream fout("multiplu.out");
queue<long long> q;
bool ok[2000005];
int main()
{
int a, b, ca, cb, m;
fin>>a>>b;
ca = a, cb = b;
while (b) {
int r = a%b;
a = b, b = r;
}
m = ca/a*1l*cb;
q.push(1);
ok[1] = true;
while (q.front()%m) {
long long x = q.front();
q.pop();
if (!ok[(x*10)%m]) q.push(x*10), ok[(x*10)%m] = true;
if (!ok[(x*10+1)%m]) q.push(x*10+1), ok[(x*10+1)%m] = true;
}
fout<<q.front();
return 0;
}