Pagini recente » Cod sursa (job #964567) | Cod sursa (job #2552856) | Cod sursa (job #1674373) | Cod sursa (job #1293159) | Cod sursa (job #3140226)
#include <fstream>
#include <vector>
#include <queue>
#define mod 998244353
using namespace std;
ifstream in("multiplu.in");
ofstream out("multiplu.out");
int gcd(int a, int b){
if(b==0)
return a;
return gcd(b, a%b);
}
int lcm(int a, int b){
return(a*b) / gcd(a,b);
}
bool only01(int 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);
int a,b;
in>>a>>b;
int lcmm = lcm(a,b);
int x=lcmm;
while(!only01(x)){
x+=lcmm;
}
out<<x;
}