#include<iostream>
using namespace std;
#define MAX 37500000
short hash[MAX*2+100];
int main()
{
int a1,a2,a3,a4,a5,cont=0,sum;
short x1,x2,x3,x4,x5;
scanf("%d%d%d%d%d",&a1,&a2,&a3,&a4,&a5);
for(x1=-50;x1<=50;x1++)
for(x2=-50;x2<=50;x2++)
for(x3=-50;x3<=50;x3++)
{
if(x1!=0&&x2!=0&&x3!=0)
{
sum=a1*x1*x1*x1+a2*x2*x2*x2+a3*x3*x3*x3;
hash[MAX+sum]++;
}
}
for(x4=-50;x4<=50;x4++)
for(x5=-50;x5<=50;x5++)
{
if(x4!=0&&x5!=0)
{
sum=(a4*x4*x4*x4+a5*x5*x5*x5)*(-1);
cont+=hash[MAX+sum];
}
}
cout<<cont<<endl;
return 0;
}
poj1840 数的hash
最新推荐文章于 2023-06-25 08:42:03 发布