Cod sursa(job #2186218)
Utilizator | Data | 25 martie 2018 13:58:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int main()
{
int n, a[1000], b[1000], R;
in >> n;
for( int i = 1; i <= n; i++ ){
in >> a[i] >> b[i];
}
for( int i = 1; i <= n; i++ ){
while( b[i] != 0 ){
R = a[i] % b[i];
a[i] = b[i];
b[i] = R;
}
out << a[i] << endl;
}
}