Pagini recente » Cod sursa (job #48650) | Cod sursa (job #2700439) | Cod sursa (job #1690793) | Cod sursa (job #2596002) | Cod sursa (job #3140227)
#include <fstream>
#include <vector>
#include <queue>
#define mod 998244353
using namespace std;
ifstream in("multiplu.in");
ofstream out("multiplu.out");
long long gcd(long long a, long long b){
if(b==0)
return a;
return gcd(b, a%b);
}
long long lcm(long long a, long long b){
return(a*b) / gcd(a,b);
}
bool only01(long long a){
while(a){
if(a%10 != 0 && a%10!=1)
return false;
a/=10;
}
return true;
}
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(0);
long long a,b;
in>>a>>b;
long long lcmm = lcm(a,b);
long long x=lcmm;
while(!only01(x)){
x+=lcmm;
}
out<<x;
}