Cod sursa(job #2357099)
| Utilizator | Data | 27 februarie 2019 09:41:02 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in"); ofstream g("euclid2.out");
int n;
int cmmdc(int x, int y) {
int r;
do {
r = x % y;
x = y;
y = r;
} while (r > 0);
return x;
}
int main() {
int a,b;
f>>n;
for (int i = 1; i <= n; ++i) {
f>>a>>b;
g<<cmmdc(a,b)<<'\n';
}
return 0;
}
