1.4 ariprog

暴力搜索，尽可能的提高效率

 

Arithmetic Progressions

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 p² + q² (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 singe 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)

1 4

37 4

2 8

29 8

1 12

5 12

13 12

17 12

5 20

2 24



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

//简单枚举
//三重循环，做的优化
//1.列举可能的ab
//2.空间换时间，p**2+q**2放在bool数组中
//3.查看在数组中时，从a+(length-1)*b而不是a,因为数组v后面较稀疏
#include <vector>
#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
	ifstream in("ariprog.in",ios::in);
	ofstream out("ariprog.out",ios::out);
	
	int length,bisq;
	in>>length>>bisq;	//读入等差数列的长度和最大的p、q值

	bool v[125000];
	int i,j;
	int max = 2*bisq*bisq;

	for(i=0; i<125000; i++)
		v[i] = false;
	for(i=0; i<=bisq; i++)
		for(j=i; j<=bisq; j++)
			v[i*i+j*j] = true;

	int a,b;	
	bool find = false;
	for(b=1; b<=max/(length-1); b++)	//枚举ab可能的取值，注意上标的计算
	{
		for(a=0; a<=max-(length-1)*b; a++)
		{
			for(i=length-1; i>=0; i--)
			{
				if(!v[a+b*i]) break;
			}
			if(i==-1) 
			{
				find = true;
				out<<a<<" "<<b<<endl;
			}
		}
	}
	if(!find) out<<"NONE"<<endl;
	return 0;
}