USACO 1.5.1_ariprog

/*
ID: cjn77881
LANG: C++
TASK: ariprog
*/

#include <stdio.h>

int N,M,idx,step,start,Nans;
int Numset[30000];
bool v[140000];

void qs(int *a,int h,int t){
	if (h>=t) return;
	int i=h,j=t,x=a[(h+t)>>1];
	while (i<j){
		while (a[i]<x) i++;
		while (a[j]>x) j--;
		if (i<=j){
			int tmp = a[i];
			a[i] = a[j];
			a[j] = tmp;
			i++; j--;
		}
	}
	qs(a,h,j);
	qs(a,i,t);
	return;
}

bool check(int a,int b){
	for (int i=a;i<=a+(N-1)*b;i+=b) if (!v[i]) return false;
	return true;
}

int main(){
	
	FILE *fin = fopen("ariprog.in","r");
	FILE *fout = fopen("ariprog.out","w");
	
	fscanf(fin,"%d\n%d",&N,&M);
	idx = 0;
	for (int i=0;i<=M;i++){
		for (int j=i;j<=M;j++) if (!v[i*i+j*j]){	
			Numset[idx] = i*i+j*j;
			v[i*i+j*j] = true;
			idx++;
		}
	}
	qs(Numset,0,idx-1);
	//printf("%d\n",idx);	
	//for (int i=0;i<idx;i++) printf("%d  ",Numset[i]);
	step =1;
	if (N>3) step = 4; //剪枝，等差数列长度若大于3，则步长至少为3.经下方注释代码检测，步长为1 2 3时，数列长度均小于等于3 
	for (step;step<=Numset[idx-1]/(N-1);step++){
		start = 0;
		while (Numset[start] <= Numset[idx-1] - (N-1)*step){
			if (check(Numset[start],step)) {
				printf("%d %d\n",Numset[start],step);
				fprintf(fout,"%d %d\n",Numset[start],step);
				Nans++;
			}
			start++;
		}
	}
	if (Nans == 0) fprintf(fout,"NONE\n");
	
	/*	
	int l=0,p=-1;
	for (int i=0;i<idx;i++){
		if (Numset[i+1]-Numset[i]==4){
			if (p==-1) p=i;	
		} else {
			if (i-p+1>=l && p!=-1) {
				l=i-p+1;
				printf("here i=%d\n",Numset[i]);	
			}
			p=-1;
		}
	}
	printf("\n%d",l);
	*/
	return 0;
}