Cod sursa(job #929773)
Utilizator | Dumitrascu Constantin Jacket | Data | 27 martie 2013 11:25:40 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
using namespace std;
int cmmdc(int a, int b) {
while( a != b ) {
if( b > a ) b -= a;
if( a > b ) a -= b;
}
return a;
}
int main()
{
int n, a, b;
freopen( "euclid2.in", "r", stdin );
freopen( "euclid2.out", "w", stdout );
scanf( "%d", &n );
for( int i = 1; i <= n; i++ ) {
scanf( "%d %d", &a, &b );
printf( "%d\n", cmmdc(a, b) );
}
return 0;
}