Pagini recente » Cod sursa (job #1292435) | Cod sursa (job #2797068) | Cod sursa (job #2079582) | Cod sursa (job #597929) | Cod sursa (job #3148728)
#include <fstream>
#include <queue>
using namespace std;
ifstream cin("multiplu.in");
ofstream cout("multiplu.out");
int gcd(int A, int B)
{
while(B)
{
int R = A % B;
A = B;
B = R;
}
return A;
}
int main()
{
int A, B;
cin >> A >> B;
int lcm = A * B / gcd(A, B);
queue<unsigned long long> Q;
Q.push(1);
bool terminat = false;
unsigned long long answer = 0;
while(!terminat)
{
unsigned long long x = Q.front();
Q.pop();
if(x % lcm == 0)
answer = x, terminat = true;
Q.push(x * 10);
Q.push(x * 10 + 1);
}
cout << answer;
return 0;
}