Cod sursa(job #2011815)
Utilizator | Data | 17 august 2017 12:16:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
using namespace std;
int gcd(int a, int b)
{
if(!b) return a;
return gcd(b, a % b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int i,T,x,y;
scanf("%d", &T);
for(i=1; i<=T; i++)
{
scanf("%d %d",&x,&y);
printf("%d\n",gcd(x,y));
}
return 0;
}