fial1's blog

By fial1, 2 months ago, In English

Hello! Codeforces Round #662 (Div. 2) will start at Friday, August 7, 2020 at 10:35UTC-4. You will be offered 6 or 7 problems (or 8) with expected difficulties to compose an interesting competition for participants with ratings up to 2100. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests — just like you will be upset if many solutions fail after the contest is over.

You will be given 6 or 7 (or 8) problems and 2 hours to solve them.

Note that the penalty for the wrong submission in this round (and the following Div. 2 rounds) is 10 minutes.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of my work. Thanks to my good friends Daria ZeroAmbition Stepanova, Mikhail pikmike Piklyaev, Maksim Ne0n25 Mescheryakov and Ivan BledDest Androsov for help in round preparation and testing the round. Also thanks to Artem Rox Plotkin and Dmitrii overrated Umnov for the discussion of ideas and testing the round!

Good luck!

 
 
 
 
  • Vote: I like it
  • -27
  • Vote: I do not like it

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

Lol ok

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

I think you realise the fact that you should not post blogs regarding important announcements as it may lead to confusion among participants. Consider editing or deleting the blog.

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

    If you look at this person's other blogs, it's a troll account.

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

I the end it was 5 problems...

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

I found a better job for you. Comedian.