Cod sursa(job #908598)
Utilizator | Data | 9 martie 2013 19:28:31 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
using namespace std;
int n;
int cmmdc(int x, int y){
if (y == 0){
return x;
}
return cmmdc(y, x % y);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &n);
while(n --){
int x;
int y;
scanf("%d %d", &x, &y);
printf("%d\n", cmmdc(x,y));
}
return 0;
}