sgu 106 The equation（限制解范围的模线性方程）

106. The equation

time limit per test: 0.5 sec. 
memory limit per test: 4096 KB

There is an equation ax + by + c = 0. Given a,b,c,x1,x2,y1,y2 you must determine, how many integer roots of this equation are satisfy to the following conditions : x1<=x<=x2,   y1<=y<=y2. Integer root of this equation is a pair of integer numbers (x,y).

Input

Input contains integer numbers a,b,c,x1,x2,y1,y2 delimited by spaces and line breaks. All numbers are not greater than 10⁸ by absolute value.

Output

Write answer to the output.

Sample Input

1 1 -3
0 4
0 4

Sample Output

4

题意：给出方程ax + by + c = 0以及解的范围x1<=x<=x2,   y1<=y<=y2。求这个方程满足约束范围的解有多少个。

思路：扩展欧几里德解不定方程。当我们得到a * x+b * y = Gcd(a, b)的一组解x0,y0后，就得到a * x+b * y = c的一组解x1 = x0*(c/Gcd(a,b)),y1 = y0*(c/Gcd(a,b))。而其他解为

 
 

  
  x = x1 + b/Gcd(a, b) * t
 
 
 
 

  
  y = y1 - a/Gcd(a, b) * t(其中t为任意整数)
 
 
 
 

  
  即x1 <= x1 + b/Gcd(a, b) * t <= x2
 
 
 
 

  
    y1 <= y1 - a/Gcd(a, b) * t <= y2
 
 
 
 

  
  将x1、x2、y1、y2带入上面两个不等式，即可得出t的范围，从而得到解的个数。
 
 
 
 

  
   
 
 
 
 

  
  
  
  
#include <iostream>

using namespace std;
typedef long long ll;
ll x, y, a, b, c, x1, x2, y1, y2, ans = 0;
ll mint = -361168601842738790LL;
ll maxt = 322337203685477580LL;
ll extend_gcd(ll a, ll b)
{
    if(!b)
    {
        x = 1;
        y = 0;
        return a;
    }
    else
    {
        ll d = extend_gcd(b, a % b);
        ll tx = x;
        x = y;
        y = tx - a / b * y;
        return d;
    }
}
ll upper(ll L, ll ab)       //向上取整
{
    if(L <= 0) return L / ab;
    return (L - 1) / ab + 1;
}
ll lower(ll R, ll ab)      //向下取整
{
    if(R >= 0) return R / ab;
    return (R + 1) / ab - 1;
}
void solve(ll L, ll R, ll ab)
{
    if(ab < 0)
    {
        L = -L;
        R = -R;
        ab = -ab;
        swap(L, R);
    }
    mint = max(mint, upper(L, ab));
    maxt = min(maxt, lower(R, ab));
}
int main()
{
    cin>>a>>b>>c>>x1>>x2>>y1>>y2;
    c = -c;
    if(!a && !b)
    {
        if(!c) ans = (x2 - x1 + 1) * (y2 - y1 + 1);
    }
    else if(!a && b)
    {
        if(c % b == 0)
        {
            ll tmp = c / b;
            if(tmp <= y2 && tmp >= y1) ans = 1;
        }
    }
    else if(!b && a)
    {
        if(c % a == 0)
        {
            ll tmp = c / a;
            if(tmp <= x2 && tmp >= x1) ans = 1;
        }
    }
    else
    {
        ll r = extend_gcd(a, b);
        if(c % r == 0)
        {
            ll x0 = x * (c / r);
            ll y0 = y * (c / r);
            b /= r;
            a /= r;
            solve(x1 - x0, x2 - x0, b);
            solve(y1 - y0, y2 - y0, -a);
            ans = maxt - mint + 1;
            if(ans < 0) ans = 0;
        }
    }
    cout<<ans<<endl;
    return 0;
}