QOJ.ac

QOJ

Time Limit: 2 s Memory Limit: 256 MB Total points: 100

#22654. 操縱乳牛選舉

Statistics

選舉時間到了。農場分成 $5\times5$ 網格,各格是一頭 Holstein 牛(H)或 Jersey 牛(J)。Jersey 牛想建立含 7 個上下左右連通格子的選區,使 Jersey 多於 Holstein。給定網格,有幾種方法?

輸入格式

  • 第 $1..5$ 行:每行 5 個字符,每個是 H 或 J,沒有空格。

輸出格式

  • 第 1 行:由 7 頭連通牛組成且 Jersey 多於 Holstein 的不同選區數。

範例

輸入格式 1

HHHHH
JHJHJ
HHHHH
HJHHJ
HHHHH

輸出格式 1

2

說明

兩個可能選區如下:

.....                .....
JHJHJ                JHJHJ
....H       and      .H...
....J                .J...
.....                .....

任何其他含七頭牛的選區都少於 4 頭 Jersey。

題目作者:Coaches,2004

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.