https://www.cnblogs.com/acfunction/p/8858577.html

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
int n,c[20],p[20],l[20],mx=-1;
int gcd(int a,int b) {
	if(b==0) return a;
	else return gcd(b,a%b);
}
void exgcd(int a,int b,int &x,int &y) {
	if(!b) {
		x=1;y=0;return ;
	}
	exgcd(b,a%b,x,y);
	int t=x;
	x=y;
	y=t-(a/b)*y;
} 
bool check(int m) {
	for(int i=1;i<=n;i++)
	  for(int j=i+1;j<=n;j++) {
	  	int a=p[j]-p[i],b=m,cc=c[i]-c[j],x=0,y=0,g=gcd(a,b);
	  	if(cc%g==0) {
	  		a/=g;b/=g;cc/=g;
	  		exgcd(a,b,x,y);
	  		b=abs(b);
	  		x=((x*cc)%b+b)%b;//得最小解
	  		if(!x) x+=b;
	  		if(x<=min(l[i],l[j])) return false;//逝去之后解得m也成立
		  }
	  }
	return true;
}
int main() {
	ios::sync_with_stdio(false);
	cin>>n;
	for(int i=1;i<=n;i++) {
		cin>>c[i]>>p[i]>>l[i];
		mx=max(mx,c[i]);
	}
	for(int i=mx;;i++)
	  if(check(i)) {
	  	cout<<i<<endl;
	  	return 0;
	  }
}