Description: Series poor problem: Given n positive integers sequence, proceed as follows: each time deleting the two numbers a and b, add a number a* b+1, until only one number N. N in all of this, there is a maximum and minimum Max Min, M = Max-Min is very poor. Calculate M operating environment: vs2008
To Search:
File list (Check if you may need any files):
CalculateRange\CalculateRange\CalculateRange.cpp
..............\..............\CalculateRange.vcproj
..............\..............\CalculateRange.vcproj.LYC-PC.Administrator.user
..............\..............\ReadMe.txt
..............\..............\stdafx.cpp
..............\..............\stdafx.h
..............\..............\targetver.h
..............\CalculateRange.ncb
..............\CalculateRange.sln
..............\CalculateRange.suo
..............\..............\Debug
..............\..............\Release
..............\CalculateRange
..............\Debug
..............\Release
CalculateRange
Download