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...

The syllabus has been changed now I guess. I give the link to the new syllabus; Strings and Graphs have had additions I guess.

http://www.ioinformatics.org/a_d_m/isc/iscdocuments/ioi-syllabus.pdf

Hey there! I’m Sumeet Varma. I am extremely interested in Algorithms and Data Structures and so I do a lot of competitive programming. I am also a big fan of Counter-Strike, Politics and reading random answers on Quora.

My team (FruitSalad) came 1st in ACM ICPC ‘17 Kharagpur Regionals, 2nd in Kolkata Regionals and 7th in India Finals and we have qualified for World Finals. Also, I have been Red on Codeforces and the highest rated Indian programmer on Codeforces, Hackerrank and Topcoder in the past.

Currently, I am doing an internship at Directi (Bangalore) as a part of my project for final semester at DA-IICT, Gandhinagar.

Ask me anything!

Moderator note: We are very excited to host Sumeet for a Q&A session! He has a max rating of 2515 on Codeforces and 2173 on TopCoder, and you can see the graph going up consistently over the last 2.5 years. It's time to find out more about the person behind ...

Hello everyone, I have created communities for all the International Science Olympiads. Here are the links:-

• International Olympiad in Informatics
• International Mathematics Olympiad
• International Olympiad on Astronomy & Astrophysics
• International Physics Olympiad
• International Linguistics Olympiad
• International Biology Olympiad
• International Chemistry Olympiad
• International Junior Science Olympiad
• International Earth Science Olympiad

Join the communities for the olympiads you are inter...

Hi everyone, I recently discovered about competetive programming and since then i m spending all my time just watching videos or reading about algorithms. i found the basic algorithms very simple to understand and implement but I am having a hard time with understanding implementations of bfs, dfs and other similar topics. Maybe its because of my unfamiliarity with STL. I also recently discovered about IOI , I solved all the recent ZIO papers.I need some help regarding the use of basic stls like vector, maps etc and implementations of intermediate algorithms(with explanations). Also should i switch to java and is there any way to implement these algorithms without using stl?.Can i use a adjancency matrix instead of a list?

P.S- I plan to be able to start solving codeforces graph problems by 3 july .I am currently in 9th grade and really want to make it to the IOI.

Thanks in advance:)

Upcoming:

• 29th Oct 2016 : CodeChef Lunchtime
• 5th Nov 2016 : COCI Contest #2
• 20th Nov 2016 : ZIO, ZCO (India)
• 26th Nov 2016 : COCI Contest #3
• 26st Nov 2016 : CodeChef Lunchtime
• Dec 2016 : USACO Contest #1
• 17th Dec 2016 : COCI Contest #4
• 31st Dec 2016 : CodeChef Lunchtime
• Jan 2017 : USACO Contest #2
• 8th Jan 2017 : INOI (India)
• 14th Jan 2017 : COCI Contest #5
• Feb 2017 : USACO Contest #3
• 4th Feb 2017 : COCI Contest #6