拓展欧几里得 板子

ax+by+c=0;
x1<=x<=x2,y1<=y<=y2
的方法数

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<queue>
#include<cmath>
#include<string>
#include<map>
#include<stack> 
#include<set>
#include<vector>
#include<iostream>
#include<algorithm>
#include<sstream>
#define INF 0x3f3f3f3f
#define ll long long
const int N=10005;
const ll MOD=998244353;
using namespace std;
ll ex_gcd(ll a,ll b,ll &x,ll &y){
	ll d,t;
	if(b==0){
		x=1;
		y=0;
		return a;
	}
	d=ex_gcd(b,a%b,x,y);
	t=x-a/b*y;
	x=y;
	y=t;
	return d;
}
int main(){
	ll a,b,c,x1,x2,y1,y2,x,y;
	cin>>a>>b>>c>>x1>>x2>>y1>>y2;
	ll d=ex_gcd(a,b,x,y);
    if(c<0) c=-c;
	x=x*c/d;
	y=y*c/d;
	ll k1=b/d,k2=a/d;
	if(c%d!=0){
		cout<<0<<endl;
		return 0;
	}
	else{
		ll r=min(floor((x2-x)*1.0/k1),floor((y-y1)*1.0/k2)) ,l=max(ceil((x1-x)*1.0/k1),ceil((y-y2)*1.0/k2));
		if(r>=l){
			cout<<r-l+1<<endl;
		} 
		else{
			cout<<0<<endl;
		}
	}
    system("pause");
	return 0;
}