BSQ

Epitech project :

Algorithm which finds the biggest square in C.

---

📝 Map format description :

• 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’.

Exemple of the map:

9
...........................
....o......................
............o..............
...........................
....o......................
..............o............
...........................
......o..............o.....
..o.......o................

---

💻 How to run :

./bsq map.txt

Exemple of output :

.....xxxxxxx................
....oxxxxxxx................
.....xxxxxxxo...............
.....xxxxxxx................
....oxxxxxxx................
.....xxxxxxx...o............
.....xxxxxxx................
......o...............o.....
..o.......o.................

---

❗ Rules :

You can only read from the given files.
You have to represent only the biggest square. If they are several solutions, choose the square to the left.

---

Made in C