AlgoUniversity
  • Go Back
Number Of Rooms :

Author

Sumeet Kumar Mishra

Difficulty Level : Easy

Submissions : 1646

Asked In :

Marks :10

: 26 | : 0

You are given a map of a building, and your task is to count the number of its rooms. The size of the map is $$$n \times m$$$ squares, and each square is either floor or wall. You can walk left, right, up, and down through the floor squares.

Input

The first input line has two integers $$$n$$$ and $$$m$$$: the height and width of the map.

Then there are $$$n$$$ lines of $$$m$$$ characters each describing the map. Each character is either '.' (floor) or '#' (wall).

Output

Print one integer: the number of rooms.

Example

Input
5 8
########
#..#...#
####.#.#
#..#...#
########
Output
3

Note

$$$1 \leq n, m \leq 1000$$$

You need to login to view your submissions.

You need to login to view all submissions.

Loading...

Result : Executed

Loading...

Feel something is wrong with the test cases?

Result : Accepted

Test Cases :

You need to Log In
We're glad that you want to attempt this problem!

But to Run or Submit the Problem, you need to Log In.

Continue to Log In
Challenge Submitted!

Your challenge has been submitted successfully.

You will get a response soon via WhatsApp or Email.

Challenge
Facing issue while trying to solve the problem! Don't worry, we got you covered!

Do let us know your issue.

Looks good!
Please enter your issue / feedback.

How do we get in touch with you?
Looks good!
Please enter your phone no.
Looks good!
Please enter your email address.