POJ 1840:Eqs 哈希求解五元方程
2015-09-08 20:37
337 查看
Eqs
Description
Consider equations having the following form:
a1x13+ a2x23+ a3x33+ a4x43+ a5x53=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
Sample Output
给定方程是a1x13+ a2x23+ a3x33+ a4x43+ a5x53=0 ,给了a1,a2,a3,a4,a5。求解 解的数量。x都在-50到50之间。
暴搜肯定GG,就得把方程变形将a1x13+ a2x23
移到方程左边,作为结果,然后暴搜x3,x4,x5。时间复杂度就降下来了。
代码:
Time Limit: 5000MS | Memory Limit: 65536K | |
Total Submissions: 14169 | Accepted: 6972 |
Consider equations having the following form:
a1x13+ a2x23+ a3x33+ a4x43+ a5x53=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
给定方程是a1x13+ a2x23+ a3x33+ a4x43+ a5x53=0 ,给了a1,a2,a3,a4,a5。求解 解的数量。x都在-50到50之间。
暴搜肯定GG,就得把方程变形将a1x13+ a2x23
移到方程左边,作为结果,然后暴搜x3,x4,x5。时间复杂度就降下来了。
代码:
#include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <string> #include <cstring> #pragma warning(disable:4996) using namespace std; short hash1[25000000]; int main() { int a1, a2, a3, a4, a5; int x1, x2, x3, x4, x5; int temp; long long sum; scanf("%d%d%d%d%d",&a1,&a2,&a3,&a4,&a5); memset(hash1, 0, sizeof(hash1)); for (x1 = -50; x1 <= 50; x1++) { if (x1 == 0)continue; for (x2 = -50; x2 <= 50; x2++) { if (x2 == 0)continue; temp = -1*(a1*x1*x1*x1 + a2*x2*x2*x2); if (temp < 0) { temp += 25000000; } hash1[temp]++; } } sum = 0; for (x3 = -50; x3 <= 50; x3++) { if (x3 == 0)continue; for (x4 = -50; x4 <= 50; x4++) { if (x4 == 0)continue; for (x5 = -50; x5 <= 50; x5++) { if (x5 == 0)continue; temp = a3*x3*x3*x3 + a4*x4*x4*x4 + a5*x5*x5*x5; if (temp < 0) { temp += 25000000; } if (temp >= 0 && temp < 25000000) { sum += hash1[temp]; } } } } cout << sum << endl; return 0; }
相关文章推荐
- 【MyBatis】 通过包含的jdbcType类型
- poj 3468 A Simple Problem with Integers【线段树区间修改】
- Android系统自带样式(android:theme)
- ContentProvider,BroadCastReceiver,Service
- js GET 方法 中文 乱码 处理
- MySQL学习----MySQL函数(二)----14MySQL格式化函数和类型转换函数
- 迭代器(Iterator)
- 1036. 跟奥巴马一起编程(15)
- Android五大存储---SQLite数据库
- getCacheDir()、getFilesDir()、getExternalFilesDir()、getExternalCacheDir()区
- 【英语】Bingo口语笔记(73) - 以tly,tely结尾的误读
- MySQL学习----MySQL函数(二)----13MySQL控制流函数
- 黑马程序员——Java中的IO流
- Android Api Demos登顶之路(六十)Content-->ClipBoard
- 写在大四的开始
- 日本語 擬態語#2 かさかさ てかてか もちもち ふにゃふにゃ
- 为什么Intent传递值会失败?
- 使用spark和spark mllib进行股票预测
- MySQL学习----MySQL函数(二)----12MySQL数据加密函数
- poj 3278 Catch That Cow