hdu 2446 Shell Pyramid(数学的东西)

 

http://acm.hdu.edu.cn/showproblem.php?pid=2446

 

题目大意：这道题说的是叠金字塔啦，最顶层是1，第二层是3，之后每一层的数量都是上面一层的数量加当前层数的值啦。所以呢，一层金字塔有1个球，两层金字塔有1+3 = 4个球，三层金字塔就有1+3+6 = 10个的球。现在给你一个编号s，问你它在金字塔中的第几层，第几行，第几列。例如19，它就在第四层，第四行，第三列。

 

解题思路：输入的编号太大，2^63，自己也没推出总和公式，所以就打表求和啦，之后二分查找，判定在第几层。再进行一次二分查找，判定在第几行和列。

 

#include <stdio.h> unsigned __int64 sum[4000000]; int bisearch1(int high1,__int64 val) { int high = high1,mid,low = 1; while (low<=high) { mid = (low+high)>>1; if (sum[mid]<=val&∑[mid+1]>=val) return mid; else if(sum[mid+1]<val) low = mid+1; else high = mid; } } inline __int64 cal(int n) { return (__int64)n*(n+1)/2; } int bisearch2(int high2, unsigned __int64 val) { int low = 0,high = high2,mid; while (low<=high) { mid = (low+high)>>1; if(cal(mid)<=val&&cal(mid+1)>=val) return mid; else if(cal(mid+1)<val) low = mid+1; else high = mid; } } int main() { int i,locate,row,k; unsigned __int64 s,tem = 0; int high1,test; sum[0] = 0; /*打表*/ for (i=1;;i++) { tem+=i; sum[i] = sum[i-1]+tem; if(sum[i]>=0x8000000000000000) break; } high1 = i; scanf("%d",&test); while(test--) { scanf("%I64u",&s); /*二分查找在第几层*/ locate = bisearch1(high1,s); if (s - sum[locate]>0) locate++; tem = s-sum[locate-1];/*这一层的编号为tem*/ /*二分查找在第几行*/ row = bisearch2(locate,tem); if(tem-cal(row)>0) { k = tem-cal(row); row++; } else k = tem-cal(row-1); printf("%d %d %d/n",locate,row,k); } return 0; }