学步园

水题，暴力枚举，但是wa了好多次，有数组开小了，还有边界处理问题，各种囧

code

/*
ID: yueqiq
PROG: ariprog
LANG: C++
*/
#include <set>
#include <map>
#include <ctime>
#include <queue>
#include <cmath>
#include <stack>
#include <limits>
#include <vector>
#include <bitset>
#include <string>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <string.h>
#include <iostream>
#include <algorithm>
#define Si set<int>
#define LL long long
#define pb push_back
#define PS printf(" ")
#define Vi vector<int>
#define LN printf("\n")
#define lson l,m,rt << 1
#define rson m+1,r,rt<<1|1
#define SD(a) scanf("%d",&a)
#define PD(a) printf("%d",a)
#define SET(a,b) memset(a,b,sizeof(a))
#define FF(i,a) for(int i(0);i<(a);i++)
#define FD(i,a) for(int i(a);i>=(1);i--)
#define FOR(i,a,b) for(int i(a);i<=(b);i++)
#define FOD(i,a,b) for(int i(a);i>=(b);i--)
#define readf freopen("ariprog.in","r",stdin)
#define writef freopen("ariprog.out","w",stdout)
const int maxn = 30001;
const int INF = 1111;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
const double pi = acos(-1.0);
using namespace std;
int s[maxn],lim,N,M,cnt;
bool use[250*250*2+1];
struct node{
    int a,b;
}ans[maxn];
void find(int k){
    FF(i,k+1) FOR(j,i,k){
        use[i*i+j*j]=true;
    }
    FOR(i,0,k*k*2){
        if(use[i]){
            s[lim++]=i;
        }
    }
    lim--;
}
bool cmp(const node x,const node y){
    if(x.b==y.b) return x.a<y.a;
    return x.b<y.b;
}
int main()
{
    readf;
    writef;
    SD(N);SD(M);
    lim=0;
    find(M);

//    FOR(i,0,lim){
//        printf("%d\n",s[i]);
//    }
    cnt=0;
    FOR(i,0,lim-1){
        FOR(j,i+1,lim){
            int d=s[j]-s[i];
            //printf("the d is %d:\n",d);
            bool flag=true;
            if(s[i]+d*(N-1) > s[lim]) break;
            FOR(k,2,N-1){
                if(!use[s[i]+k*d]){
                    flag=false;
                    break;
                }
            }
            if(flag){
                ans[cnt].a=s[i];
                ans[cnt++].b=d;
            }
        }
    }
    sort(ans,ans+cnt,cmp);
    if(!cnt) puts("NONE");
    else FOR(i,0,cnt-1) printf("%d %d\n",ans[i].a,ans[i].b);
    return 0;
}