We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent de6adb3 commit 3b471e6Copy full SHA for 3b471e6
6th_sem/problem3.md
@@ -31,7 +31,7 @@ Print a single integer, the number of possible portal placements where Captain
31
There is only 1 portal, and there are $3 \times 3 = 9$ different placements. Among them, 4 placements allow Captain Ágnes to win.
32
33
<p align="center">
34
- <img src = for_problem3.png alt="Grid Image">
+ <img src =for_problem3.PNG alt="Grid Image">
35
</p>
36
37
0 commit comments