Eqs
Time Limit: 5000MS | Memory Limit: 65536K | |
Total Submissions: 11220 | Accepted: 5480 |
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.
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
上来写了一个四层for循环,结果直接tle了,优化了几发还是tle。
将前三项移动到等式右面,就可以降低到O(n^2 + n^3)的复杂度:
-(a1x13+ a2x23+ a3x33 )= a4x43+ a5x53
把等式左面可能的取值放到一个数组中做hash,然后遍历右面的取值即可。
提交记录:
1,Wrong Answer 没有看到题目中的xi!=0 这个条件。
2.TLE 四层循环直接挂掉。。
3.Accepted 修改为三等循环+两层循环
代码:
#include
#include
#include
#include
#include
#include