Hi Codeforces! I'm 14 and am sitting the British Informatics Olympiad this January, and want to get ready for it. I just want to know what the corresponding Codeforces difficulty of a BIO round 1 question would be (maybe like q3 or 2 cause 1 is easy) and also how I can best prepare (topics and stuff) for it. Thanks!
britishinformatics.org
I guess you have a senior member in St. Paul's School (CF:boomyday12343) who participated in the IOI , get connected with him , You might get some good suggestions .
Yes! Thanks you for reminding me — I will be sure to do that. I just want to hear some insight from some other people.
Join the Jetbrains Youth Coding Club , it's a coding community where weekly contest is organized every week on Codeforces and then the solutions are given with explanation by Pavel Mavrin (IGM CF:pashka) . You will find many other coders of your stage with some highly rated coders with rating around 1600-2000.You can discuss about CP there,enjoy coding!
I have just! Thanks.
can you drop a message in chat section(jetbrains discord) ,plz I would like to get connected with you
yo guys im like in the same boat as you. Im 13 and interested in competitive programming, can I also get in touch with yall.
yeah ! Absolutely for now just join Jetbrains coding club
can you send me your discord user pls.
Sure whats your discord.
I already found you on the jetbrains discord
Question 2s aren't really comparable to Codeforces problems since it's just pure implementation with no need to think of the algorithm usually. To prepare for those just get really familiar with whatever programming language you want to use.
Every question 3 for the past 10 years has been either combinatorics (usually involving DP), or transforming the problem into a graph and running BFS. Just practice those two topics and it is very likely a similar problem will turn up this year (although you do get the rare oddity like 2013). I would estimate the difficulty to be around 1500 on average although you get a particularly difficult problem every now and then.
Thanks — this is super helpful!
sreesh_56