Introduction - If you have any usage issues, please Google them yourself
On a partition algorithm demo. Describe a 2 ^ n * 2 ^ n rectangular array, how to use three rectangular graphics fill, consisting of the last remaining a blank rectangle solution, this program USES partition recursive algorithm, to solve the problem domain is divided into four, recursive points down, get 2 * 2 the basic shape of rectangular, to solve problems.
Packet : 51622464pintu.rar filelist
PinTu\SettingDialog.h
PinTu\PinTu.rc
PinTu\Resource.h
PinTu\PinTu.aps
PinTu\PinTuView.cpp
PinTu\PinTuView.h
PinTu\PinTu.clw
PinTu\ReadMe.txt
PinTu\PinTu.h
PinTu\PinTuDoc.h
PinTu\PinTu.opt
PinTu\StdAfx.cpp
PinTu\SettingDialog.cpp
PinTu\res\PinTu.rc2
PinTu\res\PinTuDoc.ico
PinTu\res\PinTu.ico
PinTu\res
PinTu\PinTu.dsw
PinTu\Debug
PinTu\PinTu.plg
PinTu\PinTu.cpp
PinTu\MainFrm.h
PinTu\MainFrm.cpp
PinTu\StdAfx.h
PinTu\Define.h
PinTu\PinTuDoc.cpp
PinTu\PinTu.ncb
PinTu\PinTu.dsp
PinTu