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 the other 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.
See the subject for further details !
========================
Grade : B | Mark : 5
| Category | Percentage | Tests | Crash ? |
|---|---|---|---|
| 97x21 rectangle | 0% | 0/5 | x |
| 1x1 intermediate | 0% | 0/2 | x |
| Line - intermediate | 0% | 0/5 | x |
| Column - intermidiate | 0% | 0/5 | x |
| 37x137 rectangle - intermediate | 0% | 0/5 | x |
| Square 187x187 - intermediate | 0% | 0/5 | x |
| Special cases - intermediate | 0% | 0/5 | x |
| Big maps | 0% | 0/10 | x |
| Error handling | 100% | 4/4 | x |
| End scores | 9.3% | 4/46 | No |
Beware of -42 Epitech students !!!