C++实验题目(国外英语资料).docVIP

C++实验题目(国外英语资料) Phase 1 oriented process programming 1. The program with the iteration method of a cube root, a cube root of iterative formula is: : Xi + 1 = 2 * (Xi) / 3 + a/(3 * * Xi Xi) assumes that the initial value of X is a, iteration to | 1 - Xi Xi + | 10-5 power. Show the value of a = 3, 27, and (a, 1.0/3) function by calling the pow verified.. Program, enter positive integer n from the keyboard, and find the sum and output of n and its antiordinal Numbers. For example, enter 2038 and the output should be 2038 + 8302 = 10340. 3 program, use the following the so-called simple variable data translation method to calculate the Fibonacci sequence of n (the specific value) and displayed on the screen (positive integer n through the keyboard input) : explanatory variable old1 = 1, old2 = 1, newItem; The new Fibonacci term newItem is always the sum of the first two terms (old1 and old2). Then pass old1 = old2. Carry on so-called data translation. And then we compute another new Fibonacci term, newItem, and we loop around until we find the NTH term of the sequence. The calculation formula for the Fibonacci sequence is as follows: Fib (1) = 1; Fib (2) = 1; Fib of n is equal to fib of n minus 1 plus fib of n minus 2. / / any n that is greater than or equal to 3. Expand programming (choose to do), design recursive functions double fib (int n); It is used to find the NTH item of the Fibonacci sequence and returns it, and then the master function is programmed to invoke it. Program, enter positive integer m, which represents a yuan (yuan). To obtain such a scheme, use the minimum number of renminbi notes, make up the sum of the above money, and print out the results. Note that there are now 7 yuan notes in the denomination, 100, 50, 20, 10, 5, 2, 1. Programming, make any user input a year and the year is January 1 week, then any specified one day (before entering any one month of the year date), the day of the week is calculated from the program. Note that in February,