Cod sursa(job #2587169)
Utilizator | Data | 22 martie 2020 13:15:04 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclide.out");
int T[100001];
int l;
int main ()
{
int x;
fin >> x;
while (x)
{
int a, b;
fin >> a >> b;
while (b)
{
int r = a % b;
a = b;
b = r;
}
T[++l] = a;
x--;
}
for (int i = 1; i <= l; i++)
cout << T[i] << "\n";
}