(强水过) Eqs (P1840)

来源：互联网发布：google keep windows 编辑：程序博客网时间：2024/04/29 18:57

本来这处题应该是用hash做的，，还是先用直接开数组的方式直接暴过好了。

#include<iostream>using namespace std;#define N 31250010short b[N*2];int main(){int i,j,k;int go[11];for (i=1;i<6;i++)cin>>go[i];int a[121];for (i=-50;i<=50;i++) if (i!=0){for (j=-50;j<=50;j++) if (j!=0){b[(i*i*i*go[1]+j*j*j*go[2])+N]++;}}int ans=0;for (i=-50;i<=50;i++) if (i!=0){for (j=-50;j<=50;j++) if (j!=0){for (k=-50;k<=50;k++)  if (k!=0){ans+=b[-(i*i*i*go[3]+j*j*j*go[4]+k*k*k*go[5])+N];}}}cout<<ans<<endl;}

Eqs

Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 9649 Accepted: 4741

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

Source