hdu 1496 Equations(暴力,哈希表 剪枝)
来源:互联网 发布:淘宝客服日常工作内容 编辑:程序博客网 时间:2024/06/10 00:10
Equations
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5630 Accepted Submission(s): 2237
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<stdio.h>int main(){int a,b,c,d,i,j,k,count,l,s1,s2;int pow[110];while(~scanf("%d%d%d%d",&a,&b,&c,&d)){count=0;for(i=1;i<101;++i)pow[i]=i*i;if(a>0&&b>0&&c>0&&d>0||a<0&&b<0&&c<0&&d<0){printf("0\n");continue;}for(i=1;i<101;++i){for(j=1;j<101;++j){s1=a*pow[i]+b*pow[j];if(s1>0&&c>0&&d>0||s1<0&&c<0&&d<0)continue;for(k=1;k<101;++k){s2=s1+c*pow[k];if(s2%d==0){s2/=-d;if(s2>0){for(l=1;l<101;++l){if(s2==pow[l]){count++;break;}}}}}}}printf("%d\n",count*16);}return 0;}
0 0
- hdu 1496 Equations(暴力,哈希表 剪枝)
- hdu 1496 Equations(hash+暴力)
- hdu 1496 Equations(数学:暴力|| HASH)
- hdu 1496 Equations (暴力+hash)
- hdu 1496 Equations(哈希表)
- HDU 1496 Equations(哈希打表+二分暴力)
- hdu 1496 Equations hash 暴力+hash
- hdu 4569 Special equations ( 必要条件缩小范围后暴力)
- hdu 5469 Antonidas(暴力剪枝)
- HDU-5937 Equation(暴力DFS+剪枝)
- hdu 1496 Equations (hash)
- HDU 1496 Equations(hash)
- (hash)hdu 1496 Equations
- hdu 1496 Equations(hash)@
- 【UVA】10317 - Equating Equations(dfs + 剪枝)
- hdu 1496 Equations(hash备忘)
- HDU 1496 Equations(简单哈希)
- hdu 1496 -- Equations(哈希)
- Hadoop学习笔记(1)
- UVA - 712 S-Trees
- 奇怪的js回调混乱
- Error building Player: Win32Exception: ApplicationName='D:/xxxx/sdk\tools\zipalign.exe解决办法
- 试写快速排序
- hdu 1496 Equations(暴力,哈希表 剪枝)
- OC语法<4.8> Foundation框架中的-常用结构体和基本数据类型包装类
- Unity的Android手机开发的环境配置
- 算法导论 第32章 详解字符串的匹配,自动机,KMP算法
- Java多个线程之间处理共享数据的方式
- ELF文件格式
- java 指定打印机 进行打印
- C语言之结构体
- 用java实现打印功能