Pagini recente » Cod sursa (job #625258) | Cod sursa (job #1349126) | Cod sursa (job #1439362) | Cod sursa (job #165199) | Cod sursa (job #3166609)
#include <fstream>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int n = 1;
vector<int> sol;
int cmmdc(int d, int i)
{
int r;
do
{
r = d % i;
d = i;
i = r;
} while (r != 0);
return d;
}
int cmmmmc(int a, int b) { return (a * b) / cmmdc(a, b); }
int main()
{
ifstream fin("multiplu.in");
ofstream fout("multiplu.out");
int A, B;
fin >> A >> B;
int M = cmmmmc(A, B); // Calculam cel mai mic multiplu comun pentru A si B
bool found = false;
vector<int> q;
q.push_back(1);
while (!found)
{
int x = q.front();
q.erase(q.begin());
if (x % M == 0)
{
found = true;
fout << x;
}
q.push_back(x * 10);
q.push_back(x * 10 + 1);
}
fin.close();
fout.close();
return 0;
}