FLEA's blog

Moldova IOI '23 and EGOI '23 teams
By FLEA, 11 months ago, In English

Hello Codeforces. In the last days I have recieved hundreds of requests of people anxiously awating the reveal of Moldova's IOI team. After 3 days of fierce competition, I am happy to announce the 4 most talented students that will soon claim 4 perfect scores at the IOI.

Without further ado, here is the most recent and complete version of the Moldova's team:

MDA1 KrowSavcik (12th grade, 0 attempts left) — if only hearing his name doesn't scare you, then there is something wrong with you.

MDA2 SlavicG (12th grade, 0 attempts left) — he is ready to prove MIT that they were wrong in unfairly rejecting him, and revenge his last year's performance.

MDA3 Sho (12th grade, 0 attempts left) — after taking a year off to pursue girls, he is ready for his epic comeback and a deserved gold medal. You better hide your girlfriend during IOI.

MDA4 TimDee (11th grade, 1 attempts left) — Timur once tried to write an essay on his Romanian exam, but he wrote segment tree instead. Although he will fail school, he will forever remain in the IOI's hall of fame.

Altough this post might make the other teams sad, I wish everyone great success in competing for second place. Let's not forget that IOI is about celebrating competitive programming and having participants share scientific and cultural experiences.

Also, last but not least, here is a picture of Moldova's EGOI '23 team:

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

»
11 months ago, # |
← Rev. 2   Vote: I like it +41 Vote: I do not like it

TimDee SlavicG KrowSavcik orz!

It seems like IOI grind is working. I'm excited to see you guys in Hungary :)

→ Reply
  • »
    »
    11 months ago, # ^ |
      Vote: I like it +26 Vote: I do not like it

    Thank you! Will be happy to meet you in Szeged! :D

    → Reply
»
11 months ago, # |
  Vote: I like it +52 Vote: I do not like it

Lessons learned, for future generations:

  1. read constraints, don't skip problems that seem impossible without reading constraints
  2. what seems geometry won't necessarily be geometry
  3. not every problem can be turned into graph problem
  4. newbies solve greedy's better than masters
  5. a=rand(0,255), b=rand(-255,255), c=rand(-255,255), do 1e5 iterations.
6
→ Reply
»
11 months ago, # |
  Vote: I like it +17 Vote: I do not like it

Where is my credit for the inspiration?

→ Reply
  • »
    »
    11 months ago, # ^ |
      Vote: I like it +19 Vote: I do not like it

    Thank you for always being an inspiration (ᵔᴥᵔ)

    → Reply
»
11 months ago, # |
  Vote: I like it +23 Vote: I do not like it

Congratulations and Good luck!

→ Reply
»
11 months ago, # |
  Vote: I like it +8 Vote: I do not like it

Why not EGOI team? :(

→ Reply
»
10 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Wow that was funny

→ Reply