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

zy_1_BigNum
...........\BigNum.cpp
...........\BigNum.h
...........\BigNum_c.h
...........\Big_zy.dsp
...........\Big_zy.dsw
...........\Big_zy.ncb
...........\Big_zy.opt
...........\Big_zy.plg
...........\cyio.h
...........\Debug
...........\numberX_ input.txt
...........\numberX_out.txt
...........\ZY2_Big_problem.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．