Cod sursa(job #929644)
Utilizator | Data | 27 martie 2013 10:14:02 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
int n , a, b;
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 (int i=1 ; i<=n ; ++i)
{
scanf("%d %d" , &a , &b);
printf("%d\n" , gcd(a , b));
}
return 0;
}