扩展欧几里德(算法模板)
了解扩展欧几里德算法,可以问度娘, 大意:可以运用其解出gcd(a,b)=ax1+by1中的x1、y1的值
上代码:
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 int extend(int a,int b,int &x,int &y) 2 { 3 if(b == 0) 4 { 5 x = 1; 6 y = 0; 7 return a; 8 } 9 int gcd = extend(b,a%b,x,y); 10 int temp = x; 11 x = y; 12 y = temp - (a/b)*y; 13 return gcd; 14 }