关闭

poj 1840 Eqs hash

133人阅读 评论(0) 收藏 举报
分类:
Eqs
Time Limit: 5000MS   Memory Limit: 65536K
Total Submissions: 13645   Accepted: 6716

Description

Consider equations having the following form: 
a1x13+ a2x23+ a3x33+ a4x43+ a5x53=0 
The coefficients are given integers from the interval [-50,50]. 
It is consider a solution a system (x1, x2, x3, x4, x5) that verifies the equation, xi∈[-50,50], xi != 0, any i∈{1,2,3,4,5}. 

Determine how many solutions satisfy the given equation. 

Input

The only line of input contains the 5 coefficients a1, a2, a3, a4, a5, separated by blanks.

Output

The output will contain on the first line the number of the solutions for the given equation.

Sample Input

37 29 41 43 47

Sample Output

654

Source


求这个方程有多少组解

hash记录一下中值就可以辣


#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <stdlib.h>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <math.h>
#include <string.h>
using namespace std;
#define Max 25000010
short hash[Max];
int cal(int a)
{
	return a*a*a;
}
int main()
{
	int a,b,c,d,e;
	cin>>a>>b>>c>>d>>e;
	for(int i=-50;i<=50;i++)
	{
		if(i==0 ) continue;
		for(int j=-50;j<=50;j++)
		{
			if(j==0) continue;
			int k=a*cal(i)+b*cal(j);
			k+=12500000;
			hash[k]++;
		}
	}
	int res=0;
	for(int i=-50;i<=50;i++)
	{
		if(i==0) continue;
		for(int j=-50;j<=50;j++)
		{
			if(j==0) continue;
			for(int k=-50;k<=50;k++)
			{
				if(k==0) continue;
				int kk=(-c)*cal(i)+(-d)*cal(j)+(-e)*cal(k);
				kk+=12500000;
				if(kk>=0&&kk<=25000000)
				res+=hash[kk];
			}
		}
	}
	cout<<res;
	return 0;
}






0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:16056次
    • 积分:1060
    • 等级:
    • 排名:千里之外
    • 原创:93篇
    • 转载:1篇
    • 译文:0篇
    • 评论:2条
    文章分类
    最新评论