Cod sursa(job #3129804)
Utilizator | Data | 15 mai 2023 21:14:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc(int x, int y) {
int i;
while(b != 0) {
i = a % b;
a = b;
b = i;
}
return a;
}
int main() {
ios_base::sync_with_stdio(false);
int n, x, y;
for(int i = 0; i < n; i++) {
fin>>x>>y;
fout<<cmmdc(x, y)<<endl;
}
return 0;
}