Cod sursa(job #2641226)
Utilizator | Data | 10 august 2020 16:53:37 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main(void)
{
ifstream in("euclid2.in");
int k, n, m;
ofstream out("euclid2.out");
for (in >> k; k > 0; k--)
{
in >> n >> m;
while (m != 0) {
int a = m;
m = n % m;
n = a;
}
out << n << endl;
}
return 0;
}