Cod sursa(job #1423899)
Utilizator | Data | 22 aprilie 2015 23:01:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
using namespace std;
int T, x, y;
int gcd(int a, int b)
{
while(b)
{
int r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&x, &y);
printf("%d\n",gcd(x, y));
}
return 0;
}