Cod sursa(job #2165128)
| Utilizator | Data | 13 martie 2018 11:13:51 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int gcd(int a, int b) {
int r = a % b;
while(r){
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
int N;
scanf("%d\n", &N);
while(N--) {
int a, b;
scanf("%d %d\n", &a, &b);
cout << gcd(a, b) << '\n';
}
return 0;
}
