poj 1061 青蛙的约会

#include<iostream>
using namespace std;

typedef long long LL;

LL ex_gcd(LL a, LL b, LL &x, LL &y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    LL ans = ex_gcd(b, a%b, x, y);
    LL tmp = x;
    x = y;
    y =  tmp-(a/b)*y;
    return ans;
}

int main()
{
    LL n, m, l, x, y;

    while (cin>>x>>y>>m>>n>>l)
    {
        LL a = m-n, b = (y-x)%l;
        LL xx = 0, yy = -1;
        LL g = ex_gcd(a, l, xx, yy);
        if (b%g)
        {
            cout<<"Impossible"<<endl;
        }
        else
        {
            xx *= b/g;
            xx = xx%l;
            if (xx <= 0)
                xx += l;
            cout<<xx<<endl;
        }

    }
}