Cod sursa(job #1195303)
Utilizator | Kurt Godel Maarcell | Data | 6 iunie 2014 20:39:13 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <stdio.h>
int gcd(int a, int b){
if (!b) return a;
else return gcd(b, a%b);
}
int main()
{
int a,b,n,i;
freopen("euclid2.in", "r",stdin);
scanf("%d\n", &n);
freopen("euclid2.out","w",stdout);
for (i=0;i<n;i++){
scanf("%d %d\n", &a,&b);
printf("%d\n", gcd(a,b));
}
return 0;
}