I got selection to IOITC this year. I would like to know more about the camp and topics which will be discussed there. Will they teach the whole syllabus of IOI in the camp within a span 10 da...
It is dynamic programming on the digits of a number. It involves problems like this one Codeforces problem 489C.
Also, this might be useful : http://stackoverflow.com/questions/22394257/how-to-count-integers-between-large-a-and-b-with-a-certain-property/22394258#22394258
Please add a reply to this discussion and introduce yourself if you'll be using this community. Knowing more about you helps people answer your questions better!
My class 9 grades are very low. Do they make a big difference in the admission decision? What happened in your case?
According to the official IOI Syllabus, HLD and matrix operations are excluded. But I've seen a lot of -OI styled problems on these topics. Is it recommended to know them for IOI/IOITC?
My score was 110/200. Hoping for an Honorable mention! Still have 2 years to improve and perform better so a little chill for me :)
What were your scores? Really curious to know how I ...
Make a set with all co-ordinates of cultivated areas.
Then do a BFS/DFS and every time you encounter a new vertex, erase it from the set and add its number of empty neighbours to the current ans.
Keep doing BFSes till the set is empty.
Print the max of all such ans's found from BFSes
Problem in short: We are given N pairs and from each pair we have to choose one element such that the difference between chosen sum and not chosen sum is minimized. N <= 150, value of elements <= 300.
Can I get hints for this problem? My greedy solution gets 80 points on the grader though. I am unable to think of a DP solution for it.
Indian National Olympiad in Informatics (INOI) is round 2 out of 3 (i.e. intermediate) for selection into Indian IOI team.
Can someone please post some problems related to graph theory which can be useful INOI/IOI preparation?
Thanks
