Cod sursa(job #2908974)
Utilizator | Data | 7 iunie 2022 16:41:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
/* sa se afiseze */
using namespace std;
int divizor_comun(int a, int b){
}
int main() {
int a, b, nr_perechi;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
cin>>nr_perechi;
for (int i=0; i<nr_perechi; i++) {
cin >> a >> b;
}
while (a != b){
if(a>b)
a-=b;
else
b-=a;
}
cout<<a;
return 0;
}