Eqs(暴力哈希)
2016-12-02 20:26
363 查看
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
Source
Romania OI 2002
求五元三次方程解的个数#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
short hs[25000001];
int main()
{
int a1,a2,a3,a4,a5,sum,ans=0;
memset(hs,0,sizeof(hs));
scanf("%d%d%d%d%d",&a1,&a2,&a3,&a4,&a5);
for(int i=-50;i<=50;i++)
{
if(i==0)
continue;
for(int j=-50;j<=50;j++)
{
if(j==0)
continue;
sum=-1*(a1*i*i*i+a2*j*j*j);
if(sum<0)
sum+=25000000;
hs[sum]++;
}
}
for(int i=-50;i<=50;i++)
{ if(i==0)
continue;
for(int j=-50;j<=50;j++)
{ if(j==0)
continue;
for(int k=-50;k<=50;k++)
{
if(k==0)
continue;
sum=a3*i*i*i+a4*j*j*j+a5*k*k*k;
if(sum<0)
sum+=25000000;
ans+=hs[sum];
}
}
}
printf("%d\n",ans);
return 0;
}
先将方程变化成-(a1*x1^3+a2*x2^3) = a3*x3^3+a4*x4^3+a5*x5^3,如此一来缩短了时间复杂度,否则直接五个嵌套for循环必然会超时的其次,我们把sum作为下标,那么hash数组的上界就取决于a1 a2 x1 x2的组合,四个量的极端值均为50
因此上界为 50*50^3+50*50^3=12500000,由于sum也可能为负数,因此我们对hash[]的上界进行扩展,扩展到25000000,当sum<0时,我们令sum+=25000000存储到hash[],负数就改为正数表示了
由于数组很大,必须使用全局定义
同时由于数组很大,用int定义必然会MLE,因此要用char或者short定义数组,推荐short
Time Limit: 5000MS | Memory Limit: 65536K | |
Total Submissions: 15997 | Accepted: 7846 |
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
Source
Romania OI 2002
求五元三次方程解的个数#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
short hs[25000001];
int main()
{
int a1,a2,a3,a4,a5,sum,ans=0;
memset(hs,0,sizeof(hs));
scanf("%d%d%d%d%d",&a1,&a2,&a3,&a4,&a5);
for(int i=-50;i<=50;i++)
{
if(i==0)
continue;
for(int j=-50;j<=50;j++)
{
if(j==0)
continue;
sum=-1*(a1*i*i*i+a2*j*j*j);
if(sum<0)
sum+=25000000;
hs[sum]++;
}
}
for(int i=-50;i<=50;i++)
{ if(i==0)
continue;
for(int j=-50;j<=50;j++)
{ if(j==0)
continue;
for(int k=-50;k<=50;k++)
{
if(k==0)
continue;
sum=a3*i*i*i+a4*j*j*j+a5*k*k*k;
if(sum<0)
sum+=25000000;
ans+=hs[sum];
}
}
}
printf("%d\n",ans);
return 0;
}
先将方程变化成-(a1*x1^3+a2*x2^3) = a3*x3^3+a4*x4^3+a5*x5^3,如此一来缩短了时间复杂度,否则直接五个嵌套for循环必然会超时的其次,我们把sum作为下标,那么hash数组的上界就取决于a1 a2 x1 x2的组合,四个量的极端值均为50
因此上界为 50*50^3+50*50^3=12500000,由于sum也可能为负数,因此我们对hash[]的上界进行扩展,扩展到25000000,当sum<0时,我们令sum+=25000000存储到hash[],负数就改为正数表示了
由于数组很大,必须使用全局定义
同时由于数组很大,用int定义必然会MLE,因此要用char或者short定义数组,推荐short
相关文章推荐
- jvm-之native关键字
- C# webclient中文乱码问题解决方法
- Anaconda Spyder下 Ipython console 画图
- iOS APP Extension开发之TodayExtension
- Android通知Notification全面剖析
- 【POJ3498】March of the Penguins(最大流,裂点)
- PL/SQL
- ubuntu安装hp M1136打印机驱动
- 文章标题
- 关于java线程的一些了解
- 辅助网站
- 第2章 DataFactory创造数据
- QuickHit
- [USACO Mar08] 牛跑步
- C++输入输出
- 【Caffe】数据可视化
- android studio的lib和jniLibs
- 第三十四讲项目2.1-麻烦的累加涨功夫
- GBDT(MART) 迭代决策树入门教程 | 简介
- A. Ostap and Grasshopper