Cod sursa(job #1114389)
| Utilizator | Data | 21 februarie 2014 16:20:58 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.23 kb |
#include <stdio.h>
int gcd(int a,int b)
{
if(!b)
return a;
return gcd(b,a %b);
}
int main()
{
int n,i;
int a,b;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %d",&a,&b);
printf("%d\n",gcd(a,b));
}
}