Cod sursa(job #1254529)
Utilizator | Data | 2 noiembrie 2014 21:13:34 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
using namespace std;
int T, A, B;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main(void)
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
//for (scanf("%d", &T); T; --T)
cin>>T;
for (; T; --T)
{
cin>>A>>B;
cout<<gcd(A, B);
}
return 0;
}