Cod sursa(job #2359880)
Utilizator | Rares Burghelea cyg_contnr1 | Data | 1 martie 2019 10:20:48 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int cmmdc( int A, int B ){
int R = A % B;
while( B ){
R = A % B;
A = B;
B = R;
}
return A;
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int n, a, b;
scanf( "%d", &n );
for( int i = 1; i <= n; ++ i )
{
scanf( "%d%d", &a, &b );
printf("%d", cmmdc( a, b ));
}
return 0;
}