Cod sursa(job #326548)
Utilizator | Data | 25 iunie 2009 15:39:19 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<iostream>
#include<stdio.h>
long a,b;
int div( long a, long b)
{
if(b==0) return a;
else
return div(b,a%b);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
long nrt,i,x,y,n;
scanf("%ld\n",&nrt);
for(i=1;i<=nrt;i++)
{
scanf("%ld %ld\n",&x,&y);
n=div(x,y);
printf("%ld\n",n);
}
return 0;
}