HD 1496 Equations

zxiaopp

于 2015-07-15 11:34:58 发布

阅读量359

点赞数

分类专栏： hash

本文链接：https://blog.csdn.net/zxiaopp/article/details/46890891

版权

hash 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Equations

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

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

“2006校园文化活动月”之“校庆杯”大学生程序设计竞赛暨杭州电子科技大学第四届大学生程序设计竞赛

G++程序中不能设数组名为hash，编译错误。

最后sum*16

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int h[2000000+10];
int arr[110];
int a,b,c,d;
int main()
{
    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;
        }
        for(int i=1;i<=100;i++)
            arr[i]=i*i;
        memset(h,0,sizeof(h));
        int ans,sum=0;
        for(int i=1;i<=100;i++)
            for(int j=1;j<=100;j++)
            {
                ans=a*arr[i]+b*arr[j];
                h[ans+1000000]++;
            }
        for(int i=1;i<=100;i++)
            for(int j=1;j<=100;j++)
            {
                ans=-1*(c*arr[i]+d*arr[j]);
                sum+=h[ans+1000000];
            }
        printf("%d\n",sum*16);
    }

    return 0;
}