Description: Let S be a set of positive integers n, n is an even number. Please design an efficient algorithm S into two subsets S1, S2, and the two subsets are inclusive of n/2 elements. Output to a file
To Search:
File list (Check if you may need any files):
HALF
....\Debug
....\.....\HALF.exe
....\.....\HALF.ilk
....\.....\HALF.pdb
....\HALF
....\HALF.ncb
....\HALF.sln
....\HALF.suo
....\....\app.ico
....\....\app.rc
....\....\AssemblyInfo.cpp
....\....\Debug
....\....\.....\app.res
....\....\.....\AssemblyInfo.obj
....\....\.....\BuildLog.htm
....\....\.....\HALF.exe.intermediate.manifest
....\....\.....\HALF.obj
....\....\.....\HALF.pch
....\....\.....\mt.dep
....\....\.....\stdafx.obj
....\....\.....\vc90.idb
....\....\.....\vc90.pdb
....\....\HALF.cpp
....\....\HALF.vcproj
....\....\HALF.vcproj.L210-71.STUDENT.user
....\....\HALF.vcproj.YeQiang.叶强.user
....\....\ReadMe.txt
....\....\resource.h
....\....\stdafx.cpp
....\....\stdafx.h
Download