Cod sursa(job #1399517)
Utilizator | Data | 24 martie 2015 19:51:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <cstdio>
using namespace std;
inline int cmmdc(long int a,long int b){
if(b == 0){
return a;
}else{
return cmmdc(b, a%b);
}
}
int main(){
long int c,a,b,n;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%ld",&n);
for(i = 1;i <= n;++i){
scanf("%ld %ld",&a,&b);
c = cmmdc(a, b);
printf("%ld\n",c);
}
return 0;
}