Pagini recente » Cod sursa (job #2409973) | Cod sursa (job #2868573) | Cod sursa (job #1266951) | Cod sursa (job #2914424) | Cod sursa (job #2777976)
#include <iostream>
#include <fstream>
using namespace std;
long long euclid(long long a, long long b)
{
long long r;
while(b > 0)
{
r = a % b;
a = b;
b = r;
}
return a;
}
int verify(long long multiplu)
{
int ok = 1;
while(multiplu > 0)
{
if(multiplu % 10 > 1)
{
ok = 0;
}
multiplu /= 10;
}
return ok;
}
int main()
{
long long a, b, n, ok, multiplu;
ifstream fin;
fin.open("multiplu.in");
fin >> a >> b;
fin.close();
n = a * b / euclid(a, b);
ok = 1;
multiplu = 0;
while(ok == 1)
{
multiplu += n;
if(verify(multiplu) == 1)
{
ok = 0;
}
}
ofstream fout;
fout.open("multiplu.out");
fout << multiplu;
fout.close();
/// nu sunt sigur de complexitate :(
return 0;
}