Cod sursa(job #3201561)
Utilizator | Horotan Tudor tudorhorotan | Data | 8 februarie 2024 23:56:22 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int euclid (int a, int b) {
while (b != 0) {
int r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
int n, a[100001], b[100001];
fin >> n;
for (int i = 1; i <= n; ++i){
fin >> a[i] >> b[i];
}
for (int i = 1; i <= n ; ++i) {
fout << euclid(a[i], b[i]) << "\n";
}
return 0;
}