Here's the thing, I messed up my ZCO and is getting 0.

ZIO is my last shot as I am in 12th, and when I sat down to solve ZIO qpaper 2013, I was stumped by the very first question.

So, how do you come to an algorithm for problems in ZIO and what all can be done in 5 days.

EDIT: THE TEST CASES ARE CORRECT. I WAS USING NOTEPAD WHICH DIDN'T SUPPORT THE FORMAT IN WHICH THE TEST CASES WERE UPLAODED

For the problem Calvins game(INOI 1301),

If you download the official test cases from https://www.iarcs.org.in/inoi/2013/inoi2013/calvinsgame-data.zip (which I believe are the same ones that codechef uses). If you open test case 02 input file, you will notice that it begins with 173 173978 which is simply not possible since in this question 1 <= k <= n. But, If you insert a space between 173 and 978, the code will run as expected. I tried test case 4 on my computer and it gave the expected output. Is it really possible that the test cases were flawed ?

Am I just being paranoid or could the INOI 2013 results actually be flawed since they used the same test cases to judge students ?

I have attached some screenshots to help you better ...

This discussion is for expanding your array of maneuvers needed to code quickly and efficiently.

STL:

The first and most important thing that I'd like to discuss about is the C++ STL. Learning it would enable you to code up an assortment of algorithms and complicated data structures in a matter of seconds.

You can learn to use the C++ STL from the following amazing sites:

Studytonight : Contains syntax and examples for most of the STL containers and algorithms.

Sanfoundry : Shows how to implement what you've learnt in complete programs

Topcoder(Highly recommended) : This place teaches yo...

Video for concept and walkthrough

First, let's watch a slow-paced easy-to-follow walkthrough of the breadth-first search and depth-first search algorithms.

Use existing discussions for all problems. 38 out of 44 problems have hints available. ICO Online Judge is available here.

1. [WORDLIST] Word List (B)
2. [NEXTPERM] Next Permutation (B)
3. [01TILES] 0/1 Tiles (B)
4. [LEAFEAT] Leaf Eaters (I)
5. [EQGIFTS] Equal Gifts (B)
6. [ENDCORR] End of Corruption (I)
7. [BUFFALOES] Speculating on Buffaloes (B)
8. [LONGPALIN] Longest Palindrome (B) (A)
9. [NUMROUTE] Number of Routings (I)
10. [GREATESC] The Great Escape (I)
11. [BOOKSORT] Sorting Books (A)
12. [FINDNUMS] Find the Numbers (B-)