hdu 【1496】 Equations

Equations

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

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

  
  

   
   1 2 3 -4
1 1 1 1
  
  

 

Sample Output

  
  

   
   39088
0
  
  

 

Author

LL

 

Source

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

 

#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;
const int maxn = 2000000;

int has[maxn+5];
int s[105];

int main()
{
    for(int i = 1; i <= 100; i++)
        s[i] = i*i;
    int a,b,c,d;
    while(scanf("%d %d %d %d", &a, &b, &c, &d) != EOF)
    { 
        memset(has, 0, sizeof(has));   //注意必须初始化
        if((a > 0 && b > 0 && c > 0 && d > 0) || (a < 0 && b < 0 && c < 0 && d < 0))//这2种情况肯定不行
        {
            printf("0\n");
            continue;
        }
        for(int i = 1; i <= 100; i++)
            for(int j = 1; j <= 100; j++)
                has[a*s[i]+b*s[j]+maxn/2]++;    //注意结果可能为负，所以需要加上一定的值保证为正
        int ans = 0;
        for(int i = 1; i <= 100; i++)
            for(int j = 1; j <= 100; j++)
                ans += has[maxn/2-c*s[i]-d*s[j]];
        printf("%d\n", 16*ans);        //注意乘以16，以为每种情况都有正负2种选择，共有2^4 = 16种选择
    }
    return 0;
}