首页 > 代码库 > hdu 1496
hdu 1496
Equations
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5663 Accepted Submission(s): 2253
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.
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.
End of file.
Output
For each test case, output a single line containing the number of the solutions.
Sample Input
1 2 3 -41 1 1 1
Sample Output
390880
Author
LL
Source
“2006校园文化活动月”之“校庆杯”大学生程序设计竞赛暨杭州电子科技大学第四届大学生程序设计竞赛
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<cstdlib>#include<algorithm>#include<queue>#include<vector>#include<set>using namespace std;int a,b,c,d;int hash1[3000010],ans;int main(){ while(scanf("%d%d%d%d",&a,&b,&c,&d)!=EOF) { ans=0; memset(hash1,0,sizeof(hash1)); if((a>0&&b>0&&c>0&&d>0)||(a<0&&b<0&&c<0&&d<0)) { printf("0\n"); continue; } for(int x1=1;x1<101;x1++) for(int x2=1;x2<101;x2++) hash1[a*x1*x1+b*x2*x2+2000000]++; for(int x3=1;x3<101;x3++) for(int x4=1;x4<101;x4++) ans+=hash1[2000000-c*x3*x3-d*x4*x4]; ans=ans*16; printf("%d\n",ans); } return 0;}
hdu 1496
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。