POJ 1840 Eqs
来源:互联网 发布:汽车app软件下载 编辑:程序博客网 时间:2024/04/27 12:01
Eqs
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 15010 Accepted: 7366
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
Source
Romania OI 2002
按要求模拟即可
hash是个神奇的东西
下方代码注释部分是先三层循环后二层,正文部分是先二层循环后三层。两者都是正解,但是由于list插入比读取慢,先二层更快
/*#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<list>using namespace std;const int mxn=14997;list<int>ha[mxn*2];list<int>::iterator it;int x,x1,x2,x3,x4,x5;int ans=0;int main(){scanf("%d%d%d%d%d",&x1,&x2,&x3,&x4,&x5);int i,j,k;for(i=-50;i<=50;i++) for(j=-50;j<=50;j++) for(k=-50;k<=50;k++){ if(i==0||j==0||k==0)continue; x=i*i*i*x1+j*j*j*x2+k*k*k*x3; ha[x%mxn+mxn].push_back(x);//hash //x%mxn+mxn保证hash完以后是正数 }for(i=-50;i<=50;i++) for(j=-50;j<=50;j++){ if(i==0|j==0)continue; x=-(i*i*i*x4+j*j*j*x5); //检查hashfor(it=ha[x%mxn+mxn].begin();it!=ha[x%mxn+mxn].end();it++ ){if(*it==x)ans++;} }printf("%d",ans);return 0;}*/#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<list>using namespace std;const int mxn=14997;list<int>ha[mxn*2];list<int>::iterator it;int x,x1,x2,x3,x4,x5;int ans=0;int main(){scanf("%d%d%d%d%d",&x1,&x2,&x3,&x4,&x5);int i,j,k;for(i=-50;i<=50;i++) for(j=-50;j<=50;j++) { if(i==0||j==0)continue; x=i*i*i*x1+j*j*j*x2; ha[x%mxn+mxn].push_back(x);//hash //x%mxn+mxn保证hash完以后是正数 }for(i=-50;i<=50;i++) for(j=-50;j<=50;j++) for(k=-50;k<=50;k++){ if(i==0|j==0||k==0)continue; x=-(i*i*i*x3+j*j*j*x4+k*k*k*x5); //检查hashfor(it=ha[x%mxn+mxn].begin();it!=ha[x%mxn+mxn].end();it++ ){if(*it==x)ans++;} }printf("%d",ans);return 0;}
niconiconi
0 0
- poj 1840 Eqs
- POJ 1840 Eqs
- poj 1840 Eqs
- POJ 1840 Eqs
- POJ 1840 Eqs hash
- POJ-1840 Eqs【Hash】
- poj 1840 Eqs 【hash】
- POJ 1840 Eqs
- poj-1840 Eqs
- POJ 1840 Eqs
- POJ 1840 Eqs
- poj 1840 Eqs
- POJ 1840 Eqs
- POJ 1840 Eqs
- POJ 1840(Eqs)
- POJ 1840 Eqs
- POJ 1840 Eqs
- POJ 1840 Eqs
- Spark资源参数调优参数
- Unity5.2.3与android通讯
- 使用ProxySelector选择代理服务器
- Android 让Retrofit与Realm、Parceler一起使用
- 编程基础-----c++与c调用so文件
- POJ 1840 Eqs
- 搜索引擎利用机器学习排序
- App开发中利用Mob实现免费短信验证码
- 程序员的工作
- Android本地数据存储:Shared Preferences安全风险浅析
- 微信第三方开发:处理消息和事件页面发送文字信息
- Scala面向对象彻底精通及Spark源码阅读
- web day23 AJAX,XStream,JSON
- c# get和set