Mail.Ru Cup 2018 Round 2 C. Lucky Days（扩展欧几里得）

题目链接

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
	ll l1,r1,t1,l2,r2,t2;
	scanf("%lld %lld %lld",&l1,&r1,&t1);
	scanf("%lld %lld %lld",&l2,&r2,&t2);
	ll d=__gcd(t1,t2);
	if(abs(l2-l1)%d==0) {
		printf("%lld\n",min(r1-l1+1,r2-l2+1));
		return 0;
	}
	ll d1=(l2-l1)%d,d2=(l1-l2)%d;
	if(d1<0) d1+=d;
	if(d2<0) d2+=d;
	printf("%lld\n",max(1LL*0,max(min(r1-l1-d1+1,r2-l2+1),min(r1-l1+1,r2-l2-d2+1))));
}