Sorry for the late reply.

When I saw your comment for the first time, I had little to help you with. Fortunately, the problems and the best solutions have been uploaded to the IOAI website by now.

Added!

The main part is on site. The teams also received home assignments to deal with by August 4.

Age requirements? As far as I am aware, there aren't any.

I believe all the teams for 2024 have been formed already. The selection procedure differs per country, plus it is not streamlined since it's the first time. Most teams choose top students through IOI, IMO, IOL (Linguistics) selection. You can visit ioai-official.org for more info. Please note I am not an organiser, just a contestant, so please take my words with a grain of salt.

Dutch IOI Team:

Jelle van der Drift (j_vdd16) — 1st time at IOI, 0 attempts left

Boas Bakker (Boas) — 2nd time at IOI, 1 attempt left

Lucas Kuunders (Increedible) — 1st time at IOI, 1 attempt left

Lin Chenyu (Albert Lin) (2288) — 1st time at IOI, 1 attempt left

This post was made by the guy who got 5th place. No attempts left. That's rough I know

I appreciate your swift action. Enjoy your day!

Dear all,

Today I was accused of violating the rules of participating in the latest Codeforces Round. Specifically, the system detected that my solution C coincided significantly with Amrharb's solution. The submissions are presented below.

245832569 — Amrharb's solution

245842883 — my solution

While it might be true that the solutions are slightly similar (because they build up on the same mathematical idea), the style of writing code is significantly different. Most importantly, I have never known Amrharb, therefore I could not have "copied" the solution. In addition, I did not use online compliers like Ideone or Pastebin, and, most likely, neither did Amrharb.

I am therefore asking to drop the accusations of cheating. If the evidence is not convincing enough, then it is, in accordance with the rules, necessary that a punishment should be applied to my account, which, obviously, would be quite unfortunate.

Sincerely,

Fiodar Prystauka (jV_)

Constraints?

As I can see, n<=14. 14^2=196, 2^14=16384. So it's 10^6. Should pass with no problem. Or did I miss something?

Hello! Could you please tell the reason for contest extended? As for me, nothing was wrong, so I'm just curious. Thanks!

Hello there! A question to the authors of the round. I see that there are a lot of problems about Buryatia in this round. Is one of you from it, or is it just a meme? Thanks.

The other small addition you could do is that the size of used memory is calculated in a similar fashion. For instance, if you solve a DP task with an array sized(n,k), the memory complexity is O(n*k). I see that your post is mostly about time complexity, but I believe a paragraph about memory would be nice. Thanks!

Hello! I really enjoyed reading the blog, thanks! I'm a 10 grade student and I was asked to make a research into algorithm complexity a couple of months ago. There are some things I would like to point out: 1) Big-O notation represents the upper-bound assessment, i.e. the worst-case scenario. There are also other notations like Theta, Small-O, etc. that are used extremely rarely and therefore can be ignored. 2) I can't really check now, but I remember someone saying that online judges can do 5*10^8 operations per second nowadays. Again, thank you for an amazing blog, especially nice you showed lots of examples!

ok then

let the strongest win!!