CALCUL DES PGCD ET FRACTION IRRÉDUCTIBLE

//Algorithme d'euclide
#include <windows.h> 
#include <iostream.h> 
#include <conio.h>
long dividende = 0, diviseur = 0, reste = 0, quotien = 0, count = 0, count2 = 0, fr1 = 0, fr2 = 0;
char yn1;

void Euclide(int x, int y);

void main()
{
	for(;;)
	{ 	
		cout<<endl<<"Entrer la dividende : ";cin>>dividende;	
		cout<<endl<<"Entrer le diviseur : ";cin>>diviseur;
			
		Euclide(dividende, diviseur);
		dividende = 0; 
		diviseur = 0;
		count = 0;
		count2 = 0;
	}
}
void Euclide(int x, int y)
{
	for(;;)
	{
		quotien = x/y; reste = x%y;
		cout<<endl<<endl<<x<<"|"<<y<<endl<<"     "<<quotien<<endl<<reste<<endl;

		if(reste == 0)
		{

			//system("cls");
			cout<<endl<<"PGCD("<<dividende<<";"<<diviseur<<")="<<y; ++count;
			if(y == 1){cout<<" cette fraction est irreductible.";}


			if(y > 1)
			{
				fr1 = dividende/y; fr2 = diviseur/y;
				cout<<", sa fraction irreductible est "<<fr1<<"|"<<fr2<<" .";
			}

			//getch();
			//system("cls");
		}

		if(reste > 0){x=y; y=reste; ++count2; cout<<endl<<"NB etape :"<<count2;}

		if(count==1){break;}


		

	}
}