poj 1840 Eqs hash

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;
}


POJ 1840 Eqs(hash)

2014-08-20 08:40:10

POJ 1840 Eqs hash

2011-07-28 22:47:10

poj 1840 Eqs , hash

2014-08-19 16:02:24

Poj 1840 Eqs（Hash）

2015-02-13 13:25:41

POJ 1840 Eqs (hash)

2015-03-11 09:51:18

poj 1840 Eqs(Hash)

2015-07-17 21:45:42

poj 1840 Eqs 【hash】

2012-02-04 15:24:27

[POJ 1840]Eqs[hash][枚举]

2016-02-04 17:34:01

POJ 1840 Eqs (大整数的Hash)

2014-11-01 18:45:03

poj 1840 Eqs(暴力枚举+hash)

2015-04-23 09:29:47