1、题目描述
Eqs
Time Limit: 5000MS | Memory Limit: 65536K | |
Total Submissions: 5535 | Accepted: 2662 |
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
2、题意解读
此题如果直接枚举的话,有100^5次枚举,肯定超时。
左边的数据最多有100^2,可以以此建立Hash表,然后在Hash表中,对右边100^3的数据中进行枚举查找,这样就将复杂度从O(100^5)降为O(100^3)。
建立Hash表过程注意以下几点:
(1)插入过程:关键字key设为-(a1x13+ a2x23),相同的关键字情况下,要注意统计重复次数。因为虽然key相同,但是它对应着不同的x1、x2,即不同的解。
(2)解决碰撞:可以用拉链法或者开放寻址法解决碰撞,拉链法可以使用指针链表或者静态链表。从实测的效果看,开发寻址法,超时,指针链表有时可以过,有时超时;静态链表效果最好,可以达到300多MS。
3、C代码:
(1)指针链表法的关键代码:
(4)静态链表法完整代码