Cod sursa(job #2478754)
Utilizator | Data | 22 octombrie 2019 17:39:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
using namespace std;
int main() {
int nr1, nr2, rest;
cout << "Introduceti cele doua numere: " << endl;
cin >> nr1 >> nr2;
while (nr2 != 0){
rest = nr1 % nr2;
nr1 = nr2;
nr2 = rest;
}
cout << "Cel mai mare divizor comun este: " << nr1;
return 0;
}