Cod sursa(job #395806)
Utilizator | Data | 13 februarie 2010 20:07:16 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
using namespace std;
long divi(long a,long b)
{
if(!b) return a;
else return divi(b,a%b);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
long n,a,b;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%ld%ld",&a,&b);
int x;x=divi(a,b);
printf("%ld\n",x);
}
return 0;
}