Как можно прописать метод Эвклида на нахождение НОД для этой программы, каким кодом? ? Подскажите подскажите

Question

//---------------------------------------------------------------------------

#include

#include

#pragma hdrstop

//---------------------------------------------------------------------------

#pragma argsused

struct Chusla

{

float first;

float second;

};

void input( Chusla &p)

{

cout

Алексей -4444444 · Accepted Answer

Код C++ #include int nod(int,int); main() { int x,y,t; cout<<"vvedite chisla "; cin>>x>>y; t=nod(x,y); cout<<"nod="<b) a=a-b; else b=b-a; } return a; } ========== //Program finds greatest common divisor of two natural numbers. #include using namespace std; int GCD(int number1, int number2); int main() { int numb1, numb2, min, max, div; cout << "Enter the first number: "; cin >> numb1; cout << "Enter the second number: "; cin >> numb2; if (numb1 > numb2) { max = numb1; min = numb2; } else { min = numb1; max = numb2; } div = GCD(min, max); cout << "Greatest common divisor is: " << div; return 0; } int GCD(int min, int max) { int temp, mod; mod = max % min; if (mod == 0) return min; else temp = min; min = mod; max = min; GCD(min, max); }