Cod sursa(job #2640519)
| Utilizator |  Bejenariu Ionut Daniel ionut98 |
Data | 6 august 2020 17:42:36 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int x, int y) {
int r;
while (y) {
r = x % y;
x = y;
y = r;
}
return x;
}
int main() {
int cnt;
f >> cnt;
while (cnt--) {
int a, b;
f >> a >> b;
g << cmmdc(a, b) << "\n";
}
return 0;
}