形如 ax + by = c,算法思想是采用碾转相除法,由于是整数的关系,核心想法是计算出ax+by = 1,然后x、同时乘上c即其中一个特解。处理ax+by=1,只需要用碾转相除法求出r = 1的情况,然后用r的通项公式带入即可获得x和y的特解
具体详见初等数论。
//算法核心是利用辗转相除法
#include<iostream>
using namespace std;
//求解最小公约数 a>b
int gcd(int a, int b)
{
if (b)
{
return gcd(b, a%b);
}
else
{
return a;
}
}
//a > b且互质
void getData(int a, int b, int &x, int& y)
{
int p0 = 1, p1 = 1, q0 = 0, q1 = 1, n = 0;
int q, temp = 0;
if (b != 1)//虽然多写了一次这个分支,平均来看,算法会更快
{
q = a / b;
n++;
p1 = q;
temp = a % b;
a = b;
b = temp;
while (b != 1)//b代表r,r为1除法结束
{
q = a / b;
n++;
temp = p1 * q + p0;
p0 = p1, p1 = temp;
temp = q1 * q + q0;
q0 = q1, q1 = temp;
temp = a % b;
a = b;
b = temp;
}
}
else//特殊情况,b已经为1,q1为1的标记要退化为0
{
q1 = 0;
}
if (n % 2)
{
x = q1, y = -p1;
}
else
{
x = -q1, y = p1;
}
}
//交换数据
void exchange(int &a, int &b)
{
int temp = a;
a = b;
b = temp;
}
int main()
{
int x, y;
int a, b, c;
int flag, flag_a = 1, flag_b = 1;
while (cin >> a >> b >> c)
{
if (a < 0)
{
flag_a = -1;
a = -a;
}
if (b < 0)
{
flag_b = -1;
b = -b;
}
flag = a < b;
if (flag)
{
exchange(a, b);
}
int temp = gcd(a, b);
if (c % temp)
{
return -1;
}
c /= temp;
a /= temp;
b /= temp;
getData(a, b, x, y);
if (flag)
{
exchange(x, y);
}
x = x * flag_a * c, y = y * flag_b * c;
}
}