Description: 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
- [rsabignumber] - rsa majority of the computing algorithm.
- [bigintsz] - This code is a big integer class definit
- [bignum] - This program is to handle all possible a
- [bignum] - Big number library
File list (Check if you may need any files):
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
Download