hdu4282 A very hard mathematic problem
来源:互联网 发布:windows系统下载 编辑:程序博客网 时间:2024/06/10 18:50
A very hard mathematic problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3017 Accepted Submission(s): 875
Problem Description
Haoren is very good at solving mathematic problems. Today he is working a problem like this:
Find three positive integers X, Y and Z (X < Y, Z > 1) that holds
X^Z + Y^Z + XYZ = K
where K is another given integer.
Here the operator “^” means power, e.g., 2^3 = 2 * 2 * 2.
Finding a solution is quite easy to Haoren. Now he wants to challenge more: What’s the total number of different solutions?
Surprisingly, he is unable to solve this one. It seems that it’s really a very hard mathematic problem.
Now, it’s your turn.
Find three positive integers X, Y and Z (X < Y, Z > 1) that holds
X^Z + Y^Z + XYZ = K
where K is another given integer.
Here the operator “^” means power, e.g., 2^3 = 2 * 2 * 2.
Finding a solution is quite easy to Haoren. Now he wants to challenge more: What’s the total number of different solutions?
Surprisingly, he is unable to solve this one. It seems that it’s really a very hard mathematic problem.
Now, it’s your turn.
Input
There are multiple test cases.
For each case, there is only one integer K (0 < K < 2^31) in a line.
K = 0 implies the end of input.
For each case, there is only one integer K (0 < K < 2^31) in a line.
K = 0 implies the end of input.
Output
Output the total number of solutions in a line for each test case.
Sample Input
95360
Sample Output
110Hint9 = 1^2 + 2^2 + 1 * 2 * 253 = 2^3 + 3^3 + 2 * 3 * 3
Source
2012 ACM/ICPC Asia Regional Tianjin Online
Recommend
liuyiding
暴力就可以过!
#include <iostream>#include <stdio.h>#include <math.h>using namespace std;__int64 pow(__int64 a,__int64 b){ __int64 i,ans=1; for(i=0;i<b;i++) { ans*=a; } return ans;}int main(){ __int64 k,ans,a1,a2,sum; __int64 x,y,z; while(scanf("%I64d",&k)!=EOF&&k) { ans=0; __int64 temp =(__int64) sqrt(k); if(temp*temp==k)//加这里,就是250ms,不加,就超时了! ans += (temp-1)>>1; for(z=3;z<31;z++) { for(x=1;;x++) { a1=pow(x,z); if(a1>k/2) break; for(y=x+1;;y++) { a2=pow(y,z); if(a2>k) break; sum=0; sum=a1+a2+x*y*z; if(sum>k) break; if(sum==k) { ans++; break; } } } } printf("%I64d\n",ans); } return 0;}
- hdu4282 A very hard mathematic problem
- hdu4282 A very hard mathematic problem
- hdu4282 A very hard mathematic problem(二分)
- hdu4282 A very hard mathematic problem
- 【二分搜索】 hdu4282 A very hard mathematic problem
- hdu4282 A very hard mathematic problem-----天津网络赛
- HDU4282 A very hard mathematic problem(二分搜索)
- HDU4282 A very hard mathematic problem(枚举+二分)
- HDU4282 A very hard mathematic problem 快速幂
- A very hard mathematic problem
- A very hard mathematic problem
- hdu 4282 A very hard mathematic problem
- Hdu 4282 A very hard mathematic problem
- hdu 4282 A very hard mathematic problem
- hdu 4282 A very hard mathematic problem
- E - A very hard mathematic problem题解
- HDU 4282 A very hard mathematic problem
- A very hard mathematic problem(二分法)
- android如何实现开机自动启动Service或app
- hud4278 Faulty Odometer
- 两道选择题 -- 爱
- css去掉li标签前面的点
- SharePoint PeopleEditor 控件的使用
- hdu4282 A very hard mathematic problem
- Linux常用命令详解之文件处理命令二
- 图文讲解 上网本 无光驱 系统蓝屏/系统无法开机 用U盘 winpe 启动U盘 重装系统的方法(通用PE工具箱/老毛桃/大白菜WinPE)
- android的selector,背景选择器用法
- 职场人必看“升迁大法”
- Linux常用命令详解之文件处理命令三
- unity3教程基础篇—(4)动画(1)
- hdu 4283 You Are the One
- 开发日志:项目没错,但不管怎么修改页面/Java内容,在Tomcat上部署的项目都没有更新的问题