USACO 1.4.3 等差数列

题目链接

http://218.28.19.228/cogs/problem/problem.php?pid=669

后来才发现居然时限5s~o(╯□╰)o

代码：

/*************
 *Author:chanjun
 *email:15755396353@163.com
 *************/

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <string>
#include <list>
#include <deque>
#include <map>
#include <set>
#include <algorithm>
using namespace std;

#define INF 0x3f3f3f3f
#define EXP 1e-8

#define LL long long

int n,m;

int f[130000];

int main(){

    freopen("ariprog.in","r",stdin);
    freopen("ariprog.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (int i = 0; i <= m; ++i){
        for (int j = 0; j <= m; ++j){
            f[i*i+j*j]=1;
        }
    }    
    
    for (int i = 0; i <= m*m*2;++i){
        if (f[i]){
            printf("%d\n",i);
        }
    }

    int M = 2*m*m;
    int flag = 0;
    for (int i = 1; i < M; ++i){
        for (int j = 0; j <= M-(n-1)*i ;++j)
            if (f[j]){
                int k;
                for (k = 1; k < n; ++k){
                    if (f[j+k*i]==0){
                        break;
                    }
                }
                if (k >= n){
                    flag = 1;
                    printf("%d %d\n",j,i);
                }
            }    
    }    
    if (flag == 0){
        printf("NONE\n");    
    }
    //system("pause");
    return 0;
}