Cod sursa(job #3138571)
Utilizator | SS KMF SSKMF | Data | 20 iunie 2023 14:31:25 |
---|---|---|---|
Problema | Multiplu | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream cin ("multiplu.in");
ofstream cout ("multiplu.out");
int main ()
{
int divizor[2];
cin >> divizor[0] >> divizor[1];
int multiplu = 1 , configuratie = 1;
while (multiplu % divizor[0] || multiplu % divizor[1])
{
configuratie++ , multiplu = 0;
for (int bit = 0 , factor = 1 ; (1 << bit) <= configuratie ; bit++ , factor *= 10)
multiplu += factor * (configuratie >> bit & 1);
}
cout << multiplu;
cout.close(); cin.close();
return 0;
}