Breaking News: Grepper is joining You.com. Read the official announcement!

NOD recursian

Amused Antelope answered on September 17, 2022 Popularity 1/10 Helpfulness 1/10

answer NOD recursian

NOD recursian

Comment

view sourceprint?
01.
#include<iostream>
02.
 
03.
using namespace std;
04.
 
05.
 
06.
 
07.
int euclidean_NOK(int M, int N) // Ewklid algorithm
08.
 
09.
{
10.
 
11.
while (M!=N)//dokato razlikata mevdu chislata e <> 0
12.
 
13.
{ if (M>N) M-=N; else N-=M;//rawnostojnoto if (M>N) M=M-N; else N=N-M;
14.
 
15.
}//while
16.
 
17.
 
18.
return M;
19.
 
20.
}//naj-malko obsho kratno Ewklid
21.
 
22.
 
23.
 
24.
int main()//nachalo na programata
25.
 
26.
{ int M,N,obsh,NOK;
27.
 
28.
char ose;
29.
 
30.
cout<<"Da se systawi programa, chrez koqto se namira  \n";
31.
 
32.
 
33.
cout<<" nai-malko obsho kratno na dwe estestweni chisla N i M.\n";
34.
 
35.
cout<<"Primer: 45, 75 Izhod: 225 \n";
36.
 
37.
do {
38.
 
39.
cout<<"Wywedete estestweno chislo ot interwala [3..1001]: ";cin>>M;
40.
 
41.
 
42.
cout<<"Wywedete estestweno chislo ot interwala [3..1001]: ";cin>>N;
43.
 
44.
obsh=euclidean_NOK(M, N);
45.
 
46.
cout<<"NOD = "<<obsh<<endl;
47.
 
48.
NOK=M*N/obsh;
49.
 
50.
cout<<"naj-malko obsho kratno na "<<M<<" i "<<N<<" e "<<NOK<<endl;
51.
 
52.
 
53.
cout<<"She wywevdate li drugi danni <y/n>: ";cin>>ose;
54.
 
55.
}while (ose=='y');
56.
 
57.
system("pause");
58.
 
59.
return 0;
60.
 
61.
} //kraj na programa nai-malko obsho kratno Ewklid

Popularity 1/10 Helpfulness 1/10 Language whatever

Source: www.rbukvar.com

Tags: whatever

Link to this answer
Share Copy Link

Contributed on Sep 17 2022

Amused Antelope

0 Answers Avg Quality 2/10

NOD recursian

Contents

More Related Answers

NOD recursian

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.