Description: Ways to achieve half of the memorandum of the algorithm set problem, C++ implementation code. With c [n] save generated by n the size of half the set. Will be the beginning of the array c [1 .. n] initialized to 0. Show that every 1 to n a natural number sets generated by the size of half the number of the questions are not being dealt with Once detected elements in the array c [ i] value is greater than zero, as soon as i know have a natural number by half the number of set size are the problem has been resolved and the result at c [i], while there is no need to repeat the calculation of the natural number i have a half set size
To Search:
File list (Check if you may need any files):
备忘录方法（半数集问题）
........................\Debug
........................\.....\vc60.pdb
........................\.....\备忘录方法（半数集问题）.exe
........................\.....\备忘录方法（半数集问题）.obj
........................\.....\备忘录方法（半数集问题）.pdb
........................\ReadMe.txt
........................\StdAfx.cpp
........................\StdAfx.h
........................\备忘录方法（半数集问题）.cpp
........................\备忘录方法（半数集问题）.dsp
........................\备忘录方法（半数集问题）.dsw
........................\备忘录方法（半数集问题）.ncb
........................\备忘录方法（半数集问题）.opt
........................\备忘录方法（半数集问题）.plg
Download