Find the biggest square (End of project 21/04/19)
Experience in C : 2 months.
You must find the largest possible square on a board while avoiding obstacles.
The board is represented by a file passed as the program’s argument. The file is valid if it is respecting those constraints:
-
its first line contains the number of lines on the board (and only that),
-
“.” (representing an empty place) and “o” (representing an obstacle) are the only two characters for theother lines,
-
all of the lines are of the same length (except the first one),
-
it contains at least one line,•each line is terminated by ‘\n’.
You program must print the board, with some “.” replaced by “x” to represent the largest square you found.
100.00% 01 - 97x21 rectangle (5 tests)
50.00% 02 - 1x1 - intermediate (2 tests)
50.00% 02.5 - 1x1 (2 tests)
100.00% 03 - line - intermediate (5 tests)
80.00% 03.5 - line (5 tests)
100.00% 04 - column - intermediate (5 tests)
100.00% 04.5 - column (5 tests)
100.00% 05 - 34x137 rectangle - intermediate (5 tests)
100.00% 05.5 - 34x137 rectangle (5 tests)
100.00% 06 - Square 187x187 - intermediate (5 tests)
100.00% 06.5 - Square 187x187 (5 tests)
100.00% 07 - Special cases - intermediate (2 tests)
100.00% 07.5 - Special cases (2 tests)
100.00% 08 - Big maps - intermediate (10 tests)
100.00% 08.5 - Big maps (10 tests)
25.00% 09 - Error handling (4 tests)