Cod sursa(job #2369640)
Utilizator | Data | 6 martie 2019 08:39:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
int euclid(int x, int y) {
int t;
while (x % y) {
t = x % y;
x = y;
y = t;
}
return y;
}
int main() {
int n, x, y;
f >> n;
for (int i = 1; i <= n; i++) {
f >> x >> y;
g << euclid(x, y) << '\n';
}
return 0;
}