Cod sursa(job #1743453)
Utilizator | Data | 18 august 2016 10:45:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <cstdio>
using namespace std;
int cmmdc(int a, int b){
int r;
while (b){
r = a % b;
a = b;
b = r;
}
return a;
}
int main(){
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int t, i, a, b;
scanf("%d", &t);
for (i = 1; i <= t; i ++){
scanf("%d%d", &a, &b);
printf("%d\n", cmmdc(a, b));
}
return 0;
}