Cod sursa(job #2508906)
| Utilizator | Data | 13 decembrie 2019 13:30:00 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
std::ifstream fin("euclid2.in");
std::ofstream fout("euclid2.out");
int cmmdc(int a, int b)
{
if(!b)
return a;
return cmmdc(b, a % b);
}
int cmmmc(int a, int b)
{
return (a * b) / cmmdc(a, b);
}
int main()
{
int n;
int x, y;
fin >> n;
while(n--)
{
fin >> x >> y;
fout << cmmdc(x, y) << "\n";
}
return 0;
}
