POJ2115---类似于青蛙约会（拓展gcd，同余方程）

同余方程题。
(A+CX) MOD L = B MOD L;
CX= (B-A)(MOD L)
其中L为区间的长度，本题可以用位运算表示出。1LL<

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
ll x, y;
ll e_gcd(ll a, ll b, ll &x, ll&y)
{
    if (b == 0)
    {
        x = 1; y = 0;
        return a;
    }
    ll r = e_gcd(b, a%b, x, y);
    ll t = y;
    y = x - (a / b)*y;
    x = t;
    return r;
}


bool tongyu(ll a, ll b, ll n)
{
    ll d = e_gcd(a, n, x, y);
    if (b%d) return false;
    x = x*(b / d) % n;          
    x = (x % (n / d) + (n / d)) % (n / d);
    return true;
}

int main()
{
    ll A, B, C, k;
    while (cin >> A >> B >> C >> k, A || B || C || k)
    {
        if (tongyu(C, B - A, 1LL << k))
            cout << x << endl;
        else
            cout << "FOREVER" << endl;
    }
    system("pause");
}