文件名称:Farm
-
所属分类：
- 标签属性：
- 上传时间：2012-11-16
-
文件大小：876byte
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
农场灌溉问题（）
一农场由图所示的十一种小方块组成，蓝色线条为灌溉渠。若相邻两块的灌溉渠相连则只需一口水井灌溉。给出若干由字母表示的最大不超过50×50具体由(m，n)表示，的农场图，编程求出最小需要打的井数。每个测例的输出占一行。当M=N=-1时结束程序。
-Farm irrigation problems () shown in a farm by a map composed of 11 kinds of small squares, blue line for the irrigation channels. If the adjacent two of the irrigation canal is connected to only one well irrigation. Gives the maximum number of letters that do not exceed 50 × 50 concrete by the (m, n), said the farm plan, program calculated the minimum number required to play the wells. The output of each test case of a line. When M = N =- 1 o' clock program.
一农场由图所示的十一种小方块组成，蓝色线条为灌溉渠。若相邻两块的灌溉渠相连则只需一口水井灌溉。给出若干由字母表示的最大不超过50×50具体由(m，n)表示，的农场图，编程求出最小需要打的井数。每个测例的输出占一行。当M=N=-1时结束程序。
-Farm irrigation problems () shown in a farm by a map composed of 11 kinds of small squares, blue line for the irrigation channels. If the adjacent two of the irrigation canal is connected to only one well irrigation. Gives the maximum number of letters that do not exceed 50 × 50 concrete by the (m, n), said the farm plan, program calculated the minimum number required to play the wells. The output of each test case of a line. When M = N =- 1 o' clock program.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
农场灌溉.cpp
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。