Cod sursa(job #790420)
Utilizator | Data | 21 septembrie 2012 10:52:32 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include "stdio.h"
int N,A,B;
int gcd(int a,int b){
if (!b) return a;
else return gcd(b,a%b);
}
int main(){
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d";&N);
for (int i=0;i<N;i++){
scanf("%D%D",&A,&B);
printf("%d\n",gcd(A,B));
}
return 0;
}