HDU1496(hash)

最新推荐文章于 2018-06-12 00:31:46 发布

晓风残月xj

最新推荐文章于 2018-06-12 00:31:46 发布

阅读量748

点赞数

分类专栏：数据结构-hash 文章标签： hash

本文链接：https://blog.csdn.net/xiaofengcanyuexj/article/details/8888169

版权

数据结构-hash 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

Equations

Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3800 Accepted Submission(s): 1529

Problem Description

Consider equations having the following form:

a*x1^2+b*x2^2+c*x3^2+d*x4^2=0
a, b, c, d are integers from the interval [-50,50] and any of them cannot be 0.

It is consider a solution a system ( x1,x2,x3,x4 ) that verifies the equation, xi is an integer from [-100,100] and xi != 0, any i ∈{1,2,3,4}.

Determine how many solutions satisfy the given equation.

Input

The input consists of several test cases. Each test case consists of a single line containing the 4 coefficients a, b, c, d, separated by one or more blanks.
End of file.

Output

For each test case, output a single line containing the number of the solutions.

Sample Input

Sample Output

Author

超时问题有时需考虑特殊情况，如下所述

#include<stdio.h>
#include<cstring>
//using namespace std;
#define MAX 1000000
int hash[MAX*2+1];

int main()
{

int i,j,sum;
int a,b,c,d,ans;
while(scanf("%d %d %d %d",&a,&b,&c,&d)!=EOF)
{
  若memset(hash,0,sizeof(hash));放此处会超时
  if((a<0&&b<0&&c<0&&d<0)||(a>0&&b>0&&c>0&&d>0))
  {
   printf("0\n");
   continue;
  }
   memset(hash,0,sizeof(hash));/位置决定是否超时
  for(i=1;i<=100;i++)
  {
   for(j=1;j<=100;j++)
   {
    sum=a*i*i+b*j*j;
    hash[sum+MAX]++;
   }
  }
  ans=0;
  for(i=1;i<=100;i++)
  {

   for(j=1;j<=100;j++)
   {
    sum=-(c*i*i+d*j*j);
    ans+=hash[sum+MAX];
   }
  }
  ans*=16;
  printf("%d\n",ans);
}
return 0;
}