Amañar la elección bovina - Problem

#22654. Amañar la elección bovina

Statistics

Es época electoral. La granja es una cuadrícula $5\times5$; cada casilla tiene una vaca Holstein (H) o Jersey (J). Las Jersey quieren un distrito de 7 casillas conectadas vertical u horizontalmente donde superen a las Holstein. ¿Cuántas maneras hay para la cuadrícula dada?

Entrada

Líneas $1..5$: cada una contiene 5 caracteres H o J, sin espacios.

Salida

Línea 1: número de distritos distintos de 7 vacas conectadas donde las Jersey superan a las Holstein.

Ejemplos

Entrada 1

HHHHH
JHJHJ
HHHHH
HJHHJ
HHHHH

Salida 1

Nota

Los dos distritos posibles son:

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

Cualquier otro distrito de siete vacas tiene 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