CommonLounge is a community of learners who learn together. Get started with the featured resources above, ask questions and discuss related stuff with everyone.
HELP!!! HELP!!! HELP!!!by Bhuwan Chandra
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.
Read more…(62 words)
Breadth-first search and Depth-first searchby Wiki
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.
Read more…(382 words)
How to prepare for Ico?by Sidharth kumar Jha
#ioi # Preparation # Informatics
Read more…(5 words)
Tricks and Tweaks to code quickly and efficientlyby Jeswin Jacob
This discussion is for expanding your array of maneuvers needed to code quickly and efficiently.
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...
Read more…(242 words)
[LEADGAME] Lead Gameby Keshav Dhandhania
Problem statement clarification:
Now I get it, I was misinterpreting question all this time. Actually after finish of each round, lead is not the difference between points of that round. But the lead is difference between the points achieved through all rounds including current round - Lakpa Tashi Bhutia
Read more…(49 words)
Leaf Eaters (ICO online judge)by Jeswin Jacob
For those of you who haven't solved this problem, this is one of the best problems from which you can learn how limitations of memory and time can make an easy problem, difficult to solve!
Just when I obtained the accepted sign after several trials, I was quite disappointed that I got a worst case running time of 1.98 s . So I headed over to Keshav's github repository and when I tried out the solution posted, it gave me a worst case running time of 0.024 s. Wow! Now that's a huge improvement. I really wanted to upgrade my arsenal with the procedure that had been used, but to my dismay I couldn't understand how it actually works. It would be great if someone posted the technique and procedure employed in solving the problem in the link attached above!