Project for semester 1 of the Epitech Elementary Programming in C module (B-CPE-110).
Algorithm for finding the largest possible square on a game board while avoiding obstacles. The array can be obtained in two ways. The first involves reading a file passed as an argument to the program.
The full description of the project can be found in subject.pdf.
B-PSU-100> git clone [email protected]:WilliamJlvt/setting_up.git
...
B-PSU-100> make
...
B-CPE-110> cat -e example_file
9$
...........................$
....o......................$
............o..............$
...........................$
....o......................$
..............o............$
...........................$
......o..............o.....$
..o.......o................$
B-CPE-110> ./setting_up example_file | cat -e
.....xxxxxxx................$
....oxxxxxxx................$
.....xxxxxxxo...............$
.....xxxxxxx................$
....oxxxxxxx................$
.....xxxxxxx...o............$
.....xxxxxxx................$
......o...............o.....$
..o.......o.................$
B-CPE-110> ./setting_up 6 “..o..” | cat -e
..oxx.$
.o.xx.$
o....o$
....o.$
...o..$
..o...$
test | passed | results |
---|---|---|
Algorithm app | 22/22 | 100% |
Basics | 6/6 | 100% |
Data structure | 6/6 | 100% |
Optimization | 16/16 | 100% |
Parsing | 3/3 | 100% |
Robustness | 25/28 | 89.3% |
Total | 78/81 | 96.3% |
All the source code has been written according to the Epitech C Coding Style.
Fatal | Major | Minor | Info |
---|---|---|---|
0 | 0 | 0 | 0 |
This project is licensed under the GNU Public License version 3.0 - see the LICENSE file for details.