poj1840 哈希

最新推荐文章于 2017-04-09 17:27:37 发布

皮皮蟹01

最新推荐文章于 2017-04-09 17:27:37 发布

阅读量323

点赞数 1

分类专栏： ACM

本文链接：https://blog.csdn.net/shellhard/article/details/66979062

版权

ACM 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

Eqs

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 16229		Accepted: 7965

Description

Consider equations having the following form:
a1x1 ³+ a2x2 ³+ a3x3 ³+ a4x4 ³+ a5x5 ³=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

#include<iostream>
#include<cstring>
#include<string>
using namespace std;
short hashs[25000001];
int main()
{
    int a,b,c,d,e;
    while(cin>>a>>b>>c>>d>>e){
    int sb=0;
    memset(hashs,0,sizeof(hashs));
    for(int i=-50;i<=50;i++)
    {
        if(i==0)
            continue;
        for(int j=-50;j<=50;j++)
        {
            if(j==0)
                continue;
            int sum=-(a*i*i*i+b*j*j*j);
            if(sum<0)
                sum+=25000000;
            hashs[sum]++;
        }
    }
        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 sum=c*i*i*i+d*j*j*j+e*k*k*k;
                    if(sum<0)
                        sum+=25000000;
                    if(hashs[sum])
                        sb+=hashs[sum];

                }
            }
        }
        cout<<sb<<endl;
    }


}

number of the solutions for the given equation.

Sample Input