Cod sursa(job #1976096)
| Utilizator | Data | 2 mai 2017 19:07:54 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <cstdio>
using namespace std;
int T;
int euclid(int numerator, int denominator){
if (denominator == 0)
return numerator;
else
return euclid(denominator, numerator % denominator);
}
int main(){
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
for(int i = 0, a, b, cmmdc; i < T; ++i){
scanf("%d%d", &a, &b);
cmmdc = euclid(a,b);
printf("%d\n", cmmdc);
}
fclose(stdin);
fclose(stdout);
}
