Cod sursa(job #2613885)
Utilizator | Data | 10 mai 2020 20:09:35 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
using namespace std;
int main() {
int nr1 = 12 , nr2 = 42,n, rest;
fin >> n;
for (int i = 1; i <= n; i++)
{
fin >> nr1 >> nr2;
while (nr2)
{
rest = nr1 % nr2;
nr1 = nr2;
nr2 = rest;
}
fout << nr1 << "\n";
}
return 0;
}