Pagini recente » Cod sursa (job #1942898) | Cod sursa (job #2973206) | Cod sursa (job #2552292) | Cod sursa (job #2170206) | Cod sursa (job #3283658)
#include <iostream>
#include <queue>
#include <fstream>
using namespace std;
ifstream fin("multiplu.in");
ofstream fout("multiplu.out");
int main()
{
int a , b , answer=1e8;
fin >> a >> b;
queue<int> q;
q.push(1);
while(!q.empty())
{
int nr_curent = q.front(); q.pop();
if(nr_curent >= 2000000)
break;
if(nr_curent % a == 0 && nr_curent % b == 0)
{
answer=min(answer,nr_curent);
}
q.push(nr_curent*10);
q.push(nr_curent*10+1);
}
return 0;
}