Manipulando a eleição bovina - Problem

#22654. Manipulando a eleição bovina

Statistics

É época eleitoral. A fazenda é uma grade $5\times5$, cada célula com uma vaca Holstein (H) ou Jersey (J). As Jersey querem um distrito de 7 células conectadas vertical ou horizontalmente com mais Jersey que Holstein. Quantas maneiras há para a grade dada?

Entrada

Linhas $1..5$: cada uma tem 5 caracteres H ou J, sem espaços.

Saída

Linha 1: número de distritos distintos de 7 vacas conectadas com mais Jersey que Holstein.

Exemplos

Entrada 1

HHHHH
JHJHJ
HHHHH
HJHHJ
HHHHH

Saída 1

Note

Os dois distritos possíveis são:

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

Qualquer outro distrito de sete vacas tem menos de 4 Jersey.

Autores: 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:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0