Pagini recente » Autentificare | Cod sursa (job #2869080) | Istoria paginii utilizator/upb_cojocaru_matei_nitu | Istoria paginii runda/gonathan/clasament | Cod sursa (job #2783614)
#include <fstream>
#include <queue>
using namespace std;
typedef long long ll;
ifstream f ("multiplu.in");
ofstream g ("multiplu.out");
int cmmdc (int a , int b){
int r;
while (b){
r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
int a , b;
f >> a >> b;
int x = a * b / cmmdc (a , b);
queue <long long> q;
q.push (1LL);
while (q.size ()){
long long nr = q.front ();
q.pop ();
if (nr % x == 0){
g << nr << '\n';
exit (0);
}
q.push (nr * 10);
q.push (nr * 10 + 1);
}
return 0;
}