欧几里得算法（C++）

#include<iostream>
using namespace std;

int Eculid(int d,int f)
{
int X,Y,R;
X=d;
Y=f;
while(Y!=0)
{
R=X%Y;
X=Y;
Y=R;
}
return X;
}

void ExEculid(int d,int f)
{
int x1,x2,x3;
int y1,y2,y3;
int t1,t2,t3;
int q;
x1=1;
x2=0;
x3=f;
y1=0;
y2=1;
y3=d;
while(true)
{
if(y3==0)
{
cout<<"the gcd is(ExEculid):"<<x3<<endl;
cout<<"No contrary!"<<endl;
break;
}
if(y3==1)
{
cout<<"the gcd is(ExEculid):"<<y3<<endl;
cout<<"the contrary is(ExEculid):"<<y2<<endl;
break;
}
q=x3/y3;
t1=x1-q*y1;
t2=x2-q*y2;
t3=x3-q*y3;
x1=y1;
x2=y2;
x3=y3;
y1=t1;
y2=t2;
y3=t3;
}

}

void main()
{
int a,b;
cout<<"please input two numbers:";
cin>>a;
cin>>b;
cout<<"the gcd is(Eculid):"<<Eculid(a,b)<<endl;
ExEculid(a,b);
}