【USACO 1.4】Arithmetic Progressions

/*
TASK: ariprog
LANG:C++
URL:http://train.usaco.org/usacoprob2?a=PA9lOcZrdWq&S=ariprog
SOLVE：平方和最大为m*m*2，因此bq数组标记数i是否为平方和数，num数组存第i个平方和数
枚举公差q，从1到num[tol]/(n-1)，枚举起点p，从num[1]到num[tol-1]
判断数p+i*q是否为平方和数
*/
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#define ll long long
using namespace std;
bool bq[];
int n,m,tol,found;
int p,q;
int num[];
int main() {
    freopen("ariprog.in","r",stdin);
    freopen("ariprog.out","w",stdout);
    scanf("%d%d",&n,&m);
    int cnt=;
    for(int i=;i<=m;i++)
        for(int j=i;j<=m;j++)
            bq[i*i+j*j]=;
    for(int i=;i<=m*m*;i++)
        if(bq[i])num[++tol]=i;
    //printf("%d %d\n",tol,num[tol]);
    int up=num[tol]/(n-);
//    printf("%d\n",up);
    for(q=;q<=up;q++){
        for(int i=;i<tol;i++){
            p=num[i];
            int ok=;
            for(int j=;j<n&&ok;j++)
                if(bq[p+j*q]==)ok=;
            if(ok){
                printf("%d %d\n",p,q);
                found=;
            }
        }
    }
    if(!found)puts("NONE");
    return ;
}