检查解不定方程时是否把非负整数解弄成了正整数解。附 hack 生成程序。

#include<bits/stdc++.h>
using namespace std;
inline int random(int L,int R){
	long long tmp=rand()*rand()+rand();
	return (tmp%(R-L+1))+L;
}
int main(){
	//freopen("CF1932G_hack.in","w",stdout);
	int T=5;
	printf("%d\n",T);
	while(T--){
		int n=10,m=100,H=2;
		printf("%d %d %d\n",n,m,H);
		for(int i=1;i<=n;++i){
			printf("%d ",random(0,H-1));
		}
		printf("\n");
		for(int i=1;i<=n;++i){
			printf("%d ",random(0,H-1));
		}
		printf("\n");
		for(int i=1;i<=n;++i){
			for(int j=1;j<=n;++j){
				printf("%d %d\n",i,j);
			}
		}
	}
	return 0;
}