Cod sursa(job #1125188)
Utilizator | Data | 26 februarie 2014 16:16:02 | |
---|---|---|---|
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==0) return a;
return euclid(b,a%b);
}
int main()
{freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
long int n;
scanf("%ld",&n);
long long int a,b;
for(int i=1;i<=n;i++)
{
scanf("%lld%lld",&a,&b);
printf("%lld\n",euclid(a,b));
}
}