Cod sursa(job #2333169)
Utilizator | Data | 31 ianuarie 2019 19:05:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int T;
long long int a, b, r;
fin >> T;
int v[T + 1];
for (int i = 1; i <= T; i++) {
fin >> a >> b;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
v[i] = a;
}
for (int i = 1; i <= T; i++)
fout << v[i] << endl;
return 0;
}