Cod sursa(job #1015409)
Utilizator | Data | 24 octombrie 2013 16:47:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <cstdio>
using namespace std;
long long int euclid(long long int a,long long int b)
{
if(!b) return a;
else return euclid(b,a%b);
}
int main()
{freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
long long int t,a,b;
scanf("%lld",&t);
for(int i=1;i<=t;i++)
{
scanf("%lld%lld",&a,&b);
printf("%lld\n",euclid(a,b));
}
return 0;
}