Pagini recente » Cod sursa (job #1789800) | Cod sursa (job #1464994) | Cod sursa (job #1392038) | Cod sursa (job #3269031) | Cod sursa (job #3278372)
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
const int N = 1<<6;
bool vizitat[N+1];
int cmmdc(int a, int b){
while(b!=0){
int r = a%b;
a=b;
b=r;
}
return a;
}
int main(){
ifstream in("multiplu.in");
ofstream out("multiplu.out");
int a, b;
in>>a>>b;
int m = a*b/cmmdc(a, b);
queue <int> q;
q.push(1);
int k;
while(!q.empty()){
k = q.front();
q.pop();
if(!vizitat[k]){
vizitat[k]=1;
if(k%m==0){
break;
}
q.push(k*10);
q.push(k*10+1);
}
}
out << k;
in.close();
out.close();
return 0;
}