Cod sursa(job #2444993)
Utilizator | Data | 2 august 2019 10:08:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a, int b)
{
int r = a % b;
while(r) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main()
{
int T; fin >> T;
for(int i = 1; i <= T; i++) {
int a, b;
fin >> a >> b;
fout << gcd(a, b) << '\n';
}
return 0;
}