大整数问题

设n是一个k（1≤k≤80）位的十进制正整数。

问题1：对于给定的任意整数n，编程计算满足p3+p2+3p≤n的位数为m的p的个数。

问题2：对于给定的任意整数n，编程求解满足p3+p2+3p≤n的p的最大值。



要求：

对于给定的每一个测试文件（形如：numberX_input.txt），分别生成一个结果文件（形如：numberX_out.txt）。比如，对于测试文件number1_input.txt，对应的结果文件为number1_out.txt。

参考数据：

(1) 若n=1908 ； p的最大值=12

(2) 若n= 2000000000000000000000000000002452458671514234457987956856；

p的最大值= 12599210498948731647-Big problem for integer n is a k (1 ≤ k ≤ 80) decimal places positive integer. Question 1: For a given arbitrary integer n, calculated to meet the p3+ P2+ 3p ≤ n the median number m of p. Question 2: For a given arbitrary integer n, Programming Solution to meet the p3+ P2+ 3p ≤ n the p maximum. Requirements: For a given test every file (such as shape: numberX_input.txt), respectively, the results generate a document (such as shape: numberX_out.txt). For example, the test file number1_input.txt, corresponding to the outcome document for the number1_out.txt. Reference: (1) if n = 1908　p maximum = 12 (2) If n = 2000000000000000000000000000002452458671514234457987956856　p maximum = 12599210498948731647