Cod sursa(job #1743229)
Utilizator | Data | 17 august 2016 19:52:25 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<bits/stdc++.h>
using namespace std;
int n, a, b, i;
int gcd(int a, int b)
{
if (!b) return a;
return gcd( b, a % b );
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", n);
for (i = 1; i <= n; i++) {
scanf("%d %d", a, b);
printf("%d", gcd(a, b));
}
return 0;
}