Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

JasamritR's blog

By JasamritR, history, 6 weeks ago, In English

Hello, I am sitting the British Informatics Olympiad this year and wanted to know what I should do to practice.

I am very new to the informatics olympiads but I have a little experience with competitive programming. What resources should I use (other than past papers)? Are there any solid training routines. In particular are there any good resources for combinatorics? This is the first time I am practicing for a competition and it is the last year that I am able to sit the paper, so I don't want to waste it! Also happy to practice with anyone else, please let me know!

Thanks!

 
 
 
 
  • Vote: I like it
  • +5
  • Vote: I do not like it

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Basically the same as you would practice for anything else (check out Errichto's How to Practice? blog).

The only difference is that you should focus on Olympiad style tasks (they're a bit different from CF), check out COCI and USACO for easier tasks of that kind. Make sure you're aware of the syllabus for the British Olympiad, but don't get to bogged down by it, just solve lots of problems.

  • »
    »
    6 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thank you for the reply, I will check out the blog you mentioned. In what way are olympiad questions different to code forces ones?

    • »
      »
      »
      6 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      It's hard to say exactly, but in general, the ideas have more steps, and require more algorithms, while Codeforces is nowadays more adhoc and constructive. The biggest difference is the strategy, on Codeforces you are trying to fully solve tasks, while on Olympiads, there is more strategy as to whether you should do subtasks or attempt full problems.

      With that said, there are countries where Olympiads looks more like Codeforces, usually where the organizers are Codeforces enthusiasts, so make sure to check previous years.

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

I was going to ask this question too! :D

As far as im aware, there are quite a lot of implementation problems in the first round. Algorithms aren't touched on as much until the second round, although it will be helpful to recognise an algorithm problem when you see it, like an MST problem. For the written problems, a small bit of knowledge on DP and hash maps may be very useful, since a lot of the written parts following the question ask about optimisation.

»
4 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

read good books, do good problems(especially on Codeforces!) , and try your best!

Life is always a suprise!!!

:):)