USACO Training 1.5 Arithmetic Progressions

最新推荐文章于 2024-09-19 13:36:34 发布

GeekAlice

最新推荐文章于 2024-09-19 13:36:34 发布

阅读量333

点赞数 1

分类专栏： USACO Training 文章标签： c++ 经验分享算法学习

本文链接：https://blog.csdn.net/GeekAlice/article/details/127097112

版权

USACO Training 专栏收录该内容

19 篇文章 2 订阅

订阅专栏

An arithmetic progression is a sequence of the form a, a+b, a+2b, ..., a+nb where n=0, 1, 2, 3, ... . For this problem, a is a non-negative integer and b is a positive integer.

Write a program that finds all arithmetic progressions of length n in the set S of bisquares. The set of bisquares is defined as the set of all integers of the form p2 + q2 (where p and q are non-negative integers).

TIME LIMIT: 5 secs

PROGRAM NAME: ariprog

INPUT FORMAT

Line 1:	N (3 <= N <= 25), the length of progressions for which to search
Line 2:	M (1 <= M <= 250), an upper bound to limit the search to the bisquares with 0 <= p,q <= M.

SAMPLE INPUT (file ariprog.in)

5
7

OUTPUT FORMAT

If no sequence is found, a single line reading `NONE'. Otherwise, output one or more lines, each with two integers: the first element in a found sequence and the difference between consecutive elements in the same sequence. The lines should be ordered with smallest-difference sequences first and smallest starting number within those sequences first.

There will be no more than 10,000 sequences.

SAMPLE OUTPUT (file ariprog.out)

/*
ID: choiyin1
PROG: ariprog
LANG: C++
*/
 
#include <bits/stdc++.h>
 
using namespace std;
 
int main() {
    freopen("ariprog.in", "r", stdin);
    freopen("ariprog.out", "w", stdout);
    int n;
    int m;
    bool pq[127000] = {};
    cin >> n >> m;
    int squareNum = 0;
    for (int i = 0; i <= m; i ++){
        for (int j = i; j <= m; j ++){
            pq[i*i + j*j] = true;
        }
    }
    int step;
    int start;
    int maxInPq = m*m + m*m; 
    bool b = false;
    for (step = 1; step <= maxInPq; step ++){
        for (start = 0; start <= maxInPq; start ++){
            if (start + (n-1) * step > maxInPq)
                break;
            if (!pq[start])
                continue;
            int i, pos = start;
            for (i = 1; i < n && pq[pos]; i ++){
                pos += step;
            }
            if (i == n && pq[pos]){
                printf("%d %d\n", start, step);
                //cout << start << endl;
                b = true;
            }
        }
    }
    if (!b)
        cout << "NONE" << endl;
    return 0;
}