Cod sursa(job #2447371)
Utilizator | Data | 13 august 2019 08:53:25 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int d, int i)
{
int r;
while(i)
{
r = d % i;
d = i;
i = r;
}
return d;
}
int k, a, b;
int main()
{
fin >> k;
while(k --)
{
fin >> a >> b;
fout << gcd(a, b) << "\n";
}
return 0;
}