陈列馆问题：

1.问题描述

世界名画陈列馆有m*n个陈列室组成。为了防止名画被盗，需要在陈列室设置警卫机器人哨位，每算法个警卫机器人除了监视它所在的陈列室之外，还可以监视与它所在的陈列室相邻的上，下，左，右4个陈列室。

2.要求

试要求，设计一个安排警卫机器人哨位的算法，使得名画陈列馆的每个陈列室都在警卫机器人监视之下，切所用的警卫机器人数目最少。

3.结果输出

将计算的警卫机器人数及其最佳哨位安排输出到文件output.txt。文件的第1行是警卫机器人数；接下来的m行中每行n个数，0表示无哨位，1表示哨位。-Gallery problem:

1. Problem Descr iption

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.