Cod sursa(job #516611)
| Utilizator | Data | 25 decembrie 2010 08:11:19 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
unsigned long int A, B, T;
unsigned long int gcd(unsigned long int a, unsigned long int b)
{
if (!b) return a;
return gcd( b, a%b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%uld", &T);
for(; T; --T)
{
scanf("%uld %uld", &A, &B);
prinft("%uld\n", gcd( A, B));
}
return 0;
}