Cod sursa(job #774856)
Utilizator | Data | 6 august 2012 16:11:07 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <stdio.h>
using namespace std;
int T, a, b, i;
int cmmdc( int x, int y ){
if(!y) return x;
return cmmdc( y, x%y);
}
int main(){
freopen( "euclid2.in", "r", stdin);
freopen( "euclid2.out", "w", stdout);
scanf( "%d", &T);
for( i = 1; i <= T; i++ ){
scanf( "%d%d", &a, &b );
printf("%d\n", cmmdc(a, b));
}
}