题意:找一个最小的x,使得 (A+C∗x)%2k = B
题解:扩展欧几里得
原式可以化为 (C∗x)%2k=B−A,即C*x+2k *y = B-A。(x、y未知)
另gcd(C, 2k) = d,可以得C*x*d/(B-A) + 2^k*y*d/(B-A) = d
,用扩展欧几里得解即可。
orz,服了,re半天,结果是mod没有开long long…
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#include<sstream>
#include<iomanip>
#define ll long long
using namespace std;
//扩展欧几里得
//若a和b为正整数,则存在整数x,y使得gcd(a,b)=ax+by;
void exgcd(ll a, ll b, ll& d, ll& x, ll& y) { //d为a、b的最大公约数
if (!b) {
d = a;
x = 1;
y = 0;
}
else {
exgcd(b, a % b, d, y, x);
y -= x * (a / b);
}
}
ll A, B, C, k;
int main() {
while (~scanf("%lld%lld%lld%lld", &A, &B, &C, &k) && k) {
ll d, x, y;
ll kk = (1ll << k);
exgcd(C, kk, d, x, y);
if ((B - A) % d) printf("FOREVER\n");
else {
x = x * (B - A) / d;
ll mod = (kk) / d;
printf("%lld\n", ((x % mod) + mod) % mod);
}
}
return 0;
}