Cod sursa(job #2013058)
| Utilizator | Data | 20 august 2017 13:29:56 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int N;
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", __gcd(a, b));
}
return 0;
}
