You are not logged in. Please login at www.codechef.com to post your questions!

×

Topics frequently asked in INOI?

4
2

What topics are asked in INOI. I mean what are the most important topic that i should prepare for now?

asked 13 Dec '16, 15:20

coder_voder's gravatar image

2★coder_voder
593332
accept rate: 8%


Graph Theory and Dynamic Programming are probably the hot topics of INOI as told by Pushkar Misrha (he has represented India at IOI) here: https://www.quora.com/How-did-Akshat-Bubna-Pushkar-Mishra-and-Nihal-Pednekar-prepare-for-IOI

Btw the list given by @ishpreet is too long to finish completely in the time remaining for INOI since it covers almost all the basic (and some even complex for beginners) paradigms and techniques required to be known for any coding competition, not only INOI.

So I would suggest you largely practice dp and graph problems and also take a look at last years problems to get a idea of the problems given in INOI.

For practicing these topics, you can take a look at my answer here : Practice DP and Graphs and also in the comments section.

Best of luck to every participant of INOI! :)

link

answered 13 Dec '16, 19:32

nikhil_chandak's gravatar image

5★nikhil_chandak
3712
accept rate: 23%

edited 20 Dec '16, 20:37

@nikhil_chandak can you tell me what topics i should study in Graph Theory & Dynamic Programming.

(20 Dec '16, 10:29) coder_voder2★

@coder_voder Even I am novice in these areas but you can take a look at my answer here : https://discuss.codechef.com/questions/88919/how-should-i-learn-dp-and-graphs-for-inoi/88923 Well for practicing you can get started at HackerRank, here : https://www.hackerrank.com/domains/algorithms/graph-theory/page:1 and you should definitely try the ones at CodeForces, they are really good imo.

(20 Dec '16, 10:40) nikhil_chandak5★

@nikhil_chandak can you tell me which graph algorithms i should prepare?

(20 Dec '16, 10:49) coder_voder2★

@coder_voder I have listed the easy ones in the link to my other answer, ie. DFS, BFS, Dijkstra, Bellmen-Ford, FLoyd-Warshall, Johnson's algo, SCC, MST, topological sorting (Difficult ones - Min Cost Max Flow and Heavy Light Decomposition ) For HLD I found a good article here : https://blog.anudeep2011.com/heavy-light-decomposition/

(20 Dec '16, 11:16) nikhil_chandak5★

@coder_voder If you have enough time this might help you link but if you don't than practice Dynamic Programming, Number Theory, Geometry and Graph Theory. Solving past INOI problems will be also help.

link

answered 13 Dec '16, 15:33

ishpreet's gravatar image

4★ishpreet
9718
accept rate: 0%

edited 13 Dec '16, 20:15

toggle preview
Preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:

×399

question asked: 13 Dec '16, 15:20

question was seen: 1,023 times

last updated: 01 Jan '17, 15:05