poj2115 C Looooops exGCD

求是否存在x 使  c * x  =  (b - a) % (2 ^ k)  成立. 如果成立输出x，否则输出FOREVER.

易知有方程 mc-n*(1<<k）=b-a

exgcd一下即可

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#define ll long long 
using namespace std;
ll gcd(ll a,ll b)
{return b==0?a:gcd(b,a%b);}
ll exgcd(int a,int b,int &x,int &y){
    if(!b){
        x=1; y=0;
        return a;
    }
    ll r=exgcd(b,a%b,x,y);
    ll t=x; x=y; y=t-a/b*y;
    return r;
}
int main(){
    int a,b,c,k,d,x,y,t,n;
    while(cin>>a>>b>>c>>k&&a&&b){
        if(a==b) {
            cout<<"0"<<endl; continue;
        }
        ll A=c,B=1,C=b-a;
        for(int i=1;i<=k;i++) B=B*2;
        ll r=gcd(A,B);
        if(C%r!=0) {
            cout<<"FOREVER"<<endl; continue;
        }
        exgcd(A,B,x,y);
        cout<<x<<" "<<y<<" "<<b-a<<endl; 
        x=x*((b-a)/r);
        r=B/r;
        x=(x%r+r)%r;
        cout<<x<<endl;
    }
    
    return 0;
}
//poj2115