Description: Gallery problem:
1. Problem Description
Painting gallery in the world there are m* n composed of a showroom. In order to prevent the paintings stolen, you need to set the security robot sentinel showroom, each algorithm is a security robot in addition to monitor it in the showroom, you can also watch it in the showroom with the adjacent upper and lower, left, Right 4 showrooms.
2. Demand
Test requirements, design an arrangement guard robot sentinel algorithm, making paintings in each gallery showroom are under the surveillance of the security robot, cutting the number of robots used by security guards at least.
3. The resulting output
Will calculate the number of security robots and the best sentinel arrange the output to the file output.txt. Document 1 of the line is the number of security robots the next m rows in each row number n, 0 means no sentinel, one that sentinel.
To Search:
- [asdfasdf] - M pseudo-random sequence generator algor
- [MMSN] - MMSN the first wireless sensor network f
- [Gallery(NotRepeat)] - Museum issues (non-repetition), each roo
File list (Check if you may need any files):
陈列馆问题\Debug\Exhi_hall.exe
..........\.....\Exhi_hall.obj
..........\.....\Exhi_hall.pdb
..........\.....\vc60.pdb
..........\Exhi_hall.cpp
..........\Exhi_hall.dsp
..........\Exhi_hall.dsw
..........\Exhi_hall.ncb
..........\Exhi_hall.opt
..........\Exhi_hall.plg
..........\input.txt
..........\output.txt
..........\readme.txt
..........\testout.txt
..........\Debug
陈列馆问题
Download