Cod sursa(job #1510478)
Utilizator | Data | 25 octombrie 2015 02:34:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
long long euclid(long long A,long long B)
{
if(!B) return A;
return euclid(B,A%B);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
int N;
scanf("%d",&N);
long long A,B;
for(int i = 1; i <= N; ++i)
{
scanf("%lld%lld",&A,&B);
printf("%lld\n",euclid(A,B));
}
return 0;
}