Poj 1840 Eqs(Hash)
来源:互联网 发布:linux解压jar 编辑:程序博客网 时间:2024/05/16 09:20
Eqs
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 12911 Accepted: 6324
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.
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
题意;
给出一个5元3次方程,输入其5个系数,求它的解的个数
其中系数 ai∈[-50,50] 自变量xi∈[-50,0)∪(0,50]
水题不解释
#include <stdio.h>int Hash[25000001];int main(){ //cout<<Num[11010]<<endl; int ans=0; int a1,a2,a3,a4,a5; while(scanf("%d%d%d%d%d",&a1,&a2,&a3,&a4,&a5)==5) //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 pro=(-1)*(a1*x1*x1*x1+a2*x2*x2*x2); if(pro<0) pro+=25000000; Hash[pro]++; } } 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 pro=a3*x3*x3*x3+a4*x4*x4*x4+a5*x5*x5*x5; if(pro<0) pro+=25000000; if(Hash[pro]) ans+=Hash[pro]; } } } printf("%d\n",ans); return 0;}
0 0
- poj-1840 Eqs(hash)
- Poj 1840 Eqs(Hash)
- POJ 1840Eqs(hash)
- POJ 1840 Eqs hash
- POJ-1840 Eqs【Hash】
- poj 1840 Eqs 【hash】
- poj 1840 Eqs , hash
- POJ 1840 Eqs(hash)
- POJ 1840 Eqs(hash)
- POJ 1840 Eqs (hash)
- POJ-1840 Eqs Hash
- poj 1840 Eqs hash
- poj 1840 Eqs(Hash)
- POJ 1840 Eqs(简单hash入门)
- POJ题目1840 Eqs(hash)
- poj-1840-Eqs 哈希(hash)
- POJ 1840 Eqs(hash表)
- POJ 1840 Eqs(Hash+思维)
- Linux时间子系统-8篇(阅读链接)
- 编译和链接技术总结
- POJ1661---Help Jimmy
- 线性表之链式存储结构
- CentOS/Linux 解决 SSH 连接慢
- Poj 1840 Eqs(Hash)
- 数据结构学习笔记(顺序表的基本操作)
- 关于ORACLE10gR2 ASM(raw实现和asmlib实现)使用GX2000透明代理测试报告
- 许你一场春暖花开
- uCOS-II移植(Freescale MPC5644A)
- 查找序列的下一个值
- 如何安装和设置 Git
- 循环-18. 龟兔赛跑(20)
- Ping转场动画的实现之二:转场动画