http://acm.hdu.edu.cn/showproblem.php?pid=1496
hash的简单运用,等式a*a1+b*x2+c*x3+d*x4=0,可以化作:a*a1+b*x2+c*x3+d*x4+1000000=1000000,后面的就简单了,a*a1+b*x2+1000000=1000000-c*x3+d*x4;hash起来就容易些:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;
#define MAXN 2000008
int a,b,c,d;
int map[MAXN];
int main()
{
int ans;
int sum;
while(scanf("%d%d%d%d",&a,&b,&c,&d)!=EOF)
{
if((a<=0&&b<=0&&c<=0&&d<=0)||(a>=0&&b>=0&&c>=0&&d>=0))
{
printf("0\n");
continue;
}
sum=0;
// v.clear();
memset(map,0,sizeof(map));
for(int i=1;i<=100;i++)
{
for(int j=1;j<=100;j++)
{
ans=a*i*i+b*j*j ;
map[ans+1000000]++;
}
}
for(int i=1;i<=100;i++)
{
for(int j=1;j<=100;j++)
{
ans=c*i*i+d*j*j;
ans=1000000-ans;
sum+=map[ans];
}
}
printf("%d\n",sum*16);
}
return 0;
}