HDU 1399(搜索题,暴力- -!)
2010-07-25 16:17
471 查看
Starship Hakodate-maru
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 109 Accepted Submission(s): 75
Problem Description
The surveyor starship Hakodate-maru is famous for her two fuel containers with unbounded capacities. They hold the same type of atomic fuel balls.
There, however, is an inconvenience. The shapes of the fuel containers #1 and #2 are always cubic and regular tetrahedral respectively. Both of the fuel containers should be either empty or filled according to their shapes. Otherwise, the fuel balls become extremely unstable and may explode in the fuel containers. Thus, the number of fuel balls for the container #1 should be a cubic number (n^3 for some n = 0, 1, 2, 3, ...) and that for the container #2 should be a tetrahedral number (n(n+1)(n+2)/6 for some n = 0, 1, 2, 3, ...).
Hakodate-maru is now at the star base Goryokaku preparing for the next mission to create a precise and detailed chart of stars and interstellar matters. Both of the fuel containers are now empty. Commander Parus of Goryokaku will soon send a message to Captain Future of Hakodate-maru on how many fuel balls Goryokaku can supply. Captain Future should quickly answer to Commander Parus on how many fuel balls she requests before her ship leaves Goryokaku. Of course, Captain Future and her officers want as many fuel balls as possible.
For example, consider the case Commander Parus offers 151200 fuel balls. If only the fuel container #1 were available (i.e. if the fuel container #2 were unavailable), at most 148877 fuel balls could be put into the fuel container since 148877 = 53 * 53 * 53 < 151200 < 54 * 54 * 54. If only the fuel container #2 were available, at most 147440 fuel balls could be put into the fuel container since 147440 = 95 * 96 * 97 / 6 < 151200 < 96 * 97 * 98 / 6. Using both of the fuel containers #1 and #2, 151200 fuel balls can be put into the fuel containers since 151200 = 39 * 39 * 39 + 81 * 82 * 83 / 6. In this case, Captain Future's answer should be "151200".
Commander Parus's offer cannot be greater than 151200 because of the capacity of the fuel storages of Goryokaku. Captain Future and her officers know that well.
You are a fuel engineer assigned to Hakodate-maru. Your duty today is to help Captain Future with calculating the number of fuel balls she should request.
Input
The input is a sequence of at most 1024 positive integers. Each line contains a single integer. The sequence is followed by a zero, which indicates the end of data and should not be treated as input. You may assume that none of the input integers is greater than 151200.
Output
The output is composed of lines, each containing a single integer. Each output integer should be the greatest integer that is the sum of a nonnegative cubic number and a nonnegative tetrahedral number and that is not greater than the corresponding input number. No other characters should appear in the output.
Sample Input
100 64 50 20 151200 0
Sample Output
99 64 47 20 151200#include <iostream> using namespace std; int flag,n; int MAX; int judge1(int n) { flag=0; int i; for(i=0;;i++) { if(i*i*i==n) { flag=1; return i; } else if(i*i*i>n) return i; } } int judge2(int n) { flag=0; int i; for(i=0;;i++) { if(i*(i+1)*(i+2)/6==n) { flag=1; return i; } else if(i*(i+1)*(i+2)/6>n) return i; } } void judge(int x,int y) { int i,j; flag=0; MAX=-1; for(i=0;i<x;i++) { for(j=0;j<y;j++) { int x=i*i*i+j*(j+1)*(j+2)/6; if(x==n) { flag=1; return; } else if(x<n) { if(MAX<x) MAX=x; } } } } int main() { int s1,s2; while(scanf("%d",&n),n) { s1=judge1(n); if(flag) { printf("%d/n",n); continue; } s2=judge2(n); if(flag) { printf("%d/n",n); continue; } judge(s1,s2); if(flag) { printf("%d/n",n); continue; } printf("%d/n",MAX); } return 0; }
相关文章推荐
- hdu 1399 Starship Hakodate-maru (暴力搜索)
- hdu 1399 Starship Hakodate-maru (暴力搜索)
- 【暴力搜索】[HDU 1016]Prime Ring Problem
- hdu_4462 Scaring the Birds 暴力搜索
- hdu 4627 The Unsolvable Problem(暴力的搜索)
- HDU 5578 Friendship of Frog 暴力搜索
- hdu 3531 暴力搜索(细节)
- HDU 1022(栈模拟;暴力搜索)
- hdu 4770 Lights Against Dudely(暴力搜索)
- HDU-1128 暴力搜索
- [HDU 1427]速度计算24点(DFS暴力搜索)
- hdu 1427 速算24点 dfs暴力搜索
- hdu 5952 Counting Cliques 暴力搜索 2016沈阳区域赛
- hdu 1015 Safecracker 暴力搜索
- HDU - 5952 Counting Cliques(图上暴力搜索+技巧剪枝)
- 【暴力搜索】[HDU 1175]连连看
- HDU 5167 Fibonacci(DFS暴力搜索)
- 2017中国大学生程序设计竞赛 - 网络选拔赛 HDU 6152 Friend-Graph(暴力搜索)
- hdu 4770 Lights Against Dudely 暴力搜索
- 暴力搜索(HDU 5305,Friends)