Cod sursa(job #2168910)
Utilizator | Data | 14 martie 2018 12:45:49 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <cstdio>
using namespace std;
int gcd(int x, int y)
{
int r;
while(y>0)
{
r=x%y;
x=y;
y=r;
}
return x;
}
int i, t, a, b;
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &t);
for(i=1; i<=t; i++)
{
scanf("%d%d", &a, &b);
printf("%d\n", gcd(a, b));
}
fclose(stdin);
fclose(stdout);
return 0;
}