Indian National Olympiad in Informatics (INOI) is round 2 out of 3 (i.e. intermediate) for selection into Indian IOI team.
Almost made this mistake while solving aswell
Dijkstra's algorithm is an efficient shortest path algorithm for graph with weighted edges (weights are not allowed to be negative).
Basic Implementation Problem: Problem EZDIJKST
How many times are you allowed to submit a program? Will you be able to check if your program works for all the test cases and work on it again if it doesn't satisfy all the test cases?
Is there a tutorial on testing our code? So as to avoid getting set back by a silly mistake?? Also will we have feedback during the exam for INOI?
For the questions with recursion trees not all of the images loaded up, and often the right answer had to be guessed form the hidden options. (Q6,9,13,16,19,23)
I am a Google Chrome user.