Eqs
Description
Consider equations having the following form:
a1x1 3+ a2x2 3+ a3x3 3+ a4x4 3+ a5x5 3=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 |
这个题不可以直接暴力 不然会TLE;
这个考虑(-1)*(a1x13+ a2x23)=(a3x33+ a4x43+ a5x53)
可以节省时间
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
short Hash[25000001];//short可以节约内存不然MLE
int main()
{
int a,b,c,d,e;//系数
while(~scanf("%d%d%d%d%d",&a,&b,&c,&d,&e))
{
memset(Hash,0,sizeof(Hash));
for( int x1 = -50; x1 <= 50; x1++)
{
if(!x1)
continue;
for(int x2 = -50; x2 <= 50; x2++)
{
if(!x2)
continue;
int sum = (a*x1*x1*x1+b*x2*x2*x2)*(-1);
if(sum < 0)
sum += 25000000;
Hash[sum]++;
}
}
int num = 0;
for(int x3 = -50; x3 <= 50; x3++)
{
if(!x3)
continue;
for(int x4 = -50; x4 <= 50; x4++ )
{
if(!x4)
continue;
for(int x5 = -50; x5 <= 50; x5++)
{
if(!x5)
continue;
int sum = c*x3*x3*x3 + d*x4*x4*x4 + e*x5*x5*x5;
if(sum<0)
sum += 25000000;
if(Hash[sum])
num+=Hash[sum];
}
}
}
printf("%d\n",num);
}
return 0;
}