#include<iostream>
using namespace std;
int euclidean_NOK(int M, int N) // Ewklid algorithm
{ while (M!=N)//dokato razlikata mevdu chislata e <> 0
{ if (M>N) M-=N; else N-=M;//rawnostojnoto if (M>N) M=M-N; else N=N-M;
}//while
return M;
}//naj-malko obsho kratno Ewklid
int main()//nachalo na programata
{ int M,N,obsh,NOK;
char ose;
cout<<"Da se systawi programa, chrez koqto se namira \n";
cout<<" nai-malko obsho kratno na dwe estestweni chisla N i M.\n";
cout<<"Primer: 45, 75 Izhod: 225 \n";
do {
cout<<"Wywedete estestweno chislo ot interwala [3..1001]: ";cin>>M;
cout<<"Wywedete estestweno chislo ot interwala [3..1001]: ";cin>>N;
obsh=euclidean_NOK(M, N);
cout<<"NOD = "<<obsh<<endl;
NOK=M*N/obsh;
cout<<"naj-malko obsho kratno na "<<M<<" i "<<N<<" e "<<NOK<<endl;
cout<<"She wywevdate li drugi danni <y/n>: ";cin>>ose;
}while (ose=='y');
system("pause");
return 0;
} //kraj na programa nai-malko obsho kratno Ewklid
Няма коментари:
Публикуване на коментар