Cod sursa(job #2302135)
Utilizator | Data | 13 decembrie 2018 20:48:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b)
{
int r;
while((r = a%b) != 0){
a = b;
b = r;
}
return b;
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int T, a, b;
scanf("%i", &T);
while(T--){
scanf("%i%i", &a, &b);
printf("%i\n", gcd(a, b));
}
return 0;
}