Cod sursa(job #738193)
Utilizator | Data | 20 aprilie 2012 13:25:35 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<stdio.h>
int n;
long long cmmdc(long long a,long long b){
if(!b) return a;
else{
return cmmdc(b,a%b);
}
}
int main(){
long long a,b;
freopen("cmmdc.in","r",stdin);
freopen("cmmdc.out","w",stdout);
scanf("%d\n",&n);
while(n--){
scanf("%lld %lld\n",&a,&b);
printf("%lld\n",cmmdc(a,b));
}
return 0;
}