Cod sursa(job #305175)
| Utilizator |  pahomi tudor agfsdhlkj |
Data | 16 aprilie 2009 15:11:09 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.3 kb |
#include <stdio.h>
long euclid(int a, int b)
{long c;
while (b)
{c=a%b; a=b; b=c;}
return a;}
int main()
{long a,b,t;
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%ld",&t);
for(long i=1;i<=t;i++)
{scanf("%ld%ld",&a,&b);
printf("%ld\n",euclid(a,b));}
return 0;
}