Cod sursa(job #1165172)
Utilizator | Data | 2 aprilie 2014 15:38:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int T;
int A, B;
int gcd(int a, int b)
{
if (b == 0) return a;
return gcd(b, a % b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
while (T--)
{
scanf("%d %d", &A, &B);
printf("%d\n", gcd(A, B));
}
}