TORONTO KIDS COMPUTER CLUB | Aurora Saturday 14:30 Python Practice 22.02.05.
20306
post-template-default,single,single-post,postid-20306,single-format-standard,ajax_fade,page_not_loaded,,qode-theme-ver-7.6.2,wpb-js-composer js-comp-ver-6.8.0,vc_responsive

Aurora Saturday 14:30 Python Practice 22.02.05.

10 Feb Aurora Saturday 14:30 Python Practice 22.02.05.

Question:
Battleships game is a pen and paper game that was invented by Clifford Von Wickler in the early 1900s. In this game each player uses two N × N grids. One to arrange his ships and record the shots of the opponent. On the other grid the player records his own shots. Ships in battleship game can vary in size from 1 × 1 to 1 × N/2 and can be placed both vertically and horizontally. When all of the ship’s cells have been hit, the ship is considered sunk, otherwise it is still “alive”. Beside this, there can be more than one ship of each size, however none of two ships can overlap or touch.

In this problem you will be given the placement of ships on the player’s grid. You will have to calculate the number of ships that the player still owns.

Input
There is a number of tests T (T ≤ 100) on the first line. Each test case contains a positive number N (N ≤ 100) — grid size. Next N lines contain N characters each, describing the playing grid. Character ‘.’ stands for an empty cell, ‘x’ for a cell containing a ship or its part and ‘@’ for already hit part of a ship.

Output
For each test case output a single line ‘Case T: N’. Where T is the test case number (starting from 1) and N is the number of still “alive” ships.

Sample Input
2
4
x...
..x.
@.@.
....
2
..
x.

Sample Output
Case 1: 2
Case 2: 1
No Comments

Sorry, the comment form is closed at this time.