Pagini recente » Cod sursa (job #2343766) | Cod sursa (job #22775) | Cod sursa (job #1022633) | Cod sursa (job #1424638) | Cod sursa (job #972513)
Cod sursa(job #972513)
#include <cstdio>
#include <algorithm>
using namespace std;
int A, B, L;
int GCD(int A, int B)
{
if(!B) return A;
return GCD(B, A % B);
}
int LCM(int A, int B)
{
return (A * B) / GCD(A, B);
}
bool Check(int X)
{
int Temp = X;
while(Temp)
{
if(Temp % 10 > 1) return 0;
Temp /= 10;
}
return 1;
}
int main()
{
freopen("multiplu.in", "r", stdin);
freopen("multiplu.out", "w", stdout);
scanf("%i %i", &A, &B);
L = LCM(A, B);
for(int i = 1; ; ++ i)
if(Check(L * i))
{
printf("%i\n", L * i);
return 0;
}
return 0;
}