L’erba migliore - Problem

#22328. L’erba migliore

Statistics

Bessie pianifica una giornata mangiando tenera erba primaverile e guarda il prato che Farmer John ha amorevolmente diviso in $R$ righe ($(1 \le R \le 100)$) e $C$ colonne ($(1 \le C \le 100)$). Vuole contare i ciuffi.

Un ciuffo è un # oppure due # adiacenti per un lato, non in diagonale. Dalla mappa indica quanti sono.

Ad esempio la mappa seguente ha $R$ pari a $5$ e $C$ pari a $6$:

.#....
..#...
..#..#
...##.
.#....

Ci sono $5$ ciuffi: uno in riga $1$; uno in colonna $2$ tra righe $2$ e $3$; uno isolato in riga $3$; uno in riga $4$ tra colonne $4$ e $5$; un altro in riga $5$.

Input

Riga $1$: interi $R$ e $C$ separati da spazi.
Righe $2,\ldots,R+1$: la riga $i+1$ descrive la riga $i$ con $C$ caratteri, ciascuno # o ..

Output

Riga $1$: un intero, numero di ciuffi che Bessie può mangiare.

Esempi

Input 1

5 6
.#....
..#...
..#..#
...##.
.#....

Output 1

Autore del problema: Rob Kolstad, 2008

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