poj 1840 -- Eqs

Eqs

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 11865		Accepted: 5811

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 number of the solutions for the given equation.

Sample Input

37 29 41 43 47

Sample Output

654

思路：hash水过。

/*======================================================================
 *           Author :   kevin
 *         Filename :   Eqs.cpp
 *       Creat time :   2014-07-24 17:49
 *      Description :
========================================================================*/
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#define clr(a,b) memset(a,b,sizeof(a))
#define M 12500000
using namespace std;
short int ha[2*M+5];
int main(int argc,char *argv[])
{
    int a,b,c,d,e;
    while(scanf("%d%d%d%d%d",&a,&b,&c,&d,&e)!=EOF){
        clr(ha,0);
        for(int i = -50; i <= 50; i++){
            if(!i) continue;
            for(int j = -50; j <= 50; j++){
                if(!j) continue;
                int s = a*i*i*i+b*j*j*j;
                ha[M-s]++;
            }
        }
        int cnt = 0;
        for(int i = -50; i <= 50; i++){
            if(!i) continue;
            for(int j = -50; j <= 50; j++){
                if(!j) continue;
                for(int k = -50; k <= 50; k++){
                    if(!k) continue;
                    int s = c*i*i*i+d*j*j*j+e*k*k*k;
                    s = M+s;
                    if(s < 2*M && s > 0)
                        cnt += ha[s];
                }
            }
        }
        printf("%d
",cnt);
    }
    return 0;
}