Cod sursa(job #2485653)
| Utilizator | Data | 1 noiembrie 2019 21:02:51 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(int a, int b) {
while(a != b) {
if(a > b)
a -= b;
else
b -= a;
}
return a;
}
int main() {
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n, x, y;
fin >> n;
for(int i = 0; i < n; i++) {
fin >> x >> y;
fout << cmmdc(x, y) << '\n';
}
fin.close();
fout.close();
return 0;
}