By NALP, 9 years ago, translation, In English,
Hello everybody.

I would like to invite you to participate in a new competition, that will be held on the 30th of October at 16:00 MSK. It will be a part of the series of winter programming school olympiads, but it will be only a standart Codeforces round for adult participants.

Teams aren't invited, only single members. The official rules will be ACM-ICPC.
Jury has decided to increase the duration of the competition, which will be 4 hours long.

Attention: People, who are considered out of competition, are participants of Codeforces Round #38, others are participants of School Personal Contest #1. But we will use merged result table for updating rating.


The authors are me, Mike Mirzayanov and Artem Rakhov. Also I'm expressing gratitude to Maria Belova, Max Ivanov and Natalia Bondarenko for help.

P.S. Please, don't forget to register to the competition!

UPD: The contest has finished, thanks to all. I hope, you have got fun :)

Congratulations to tourist. It tooks him ~2 hours to solve all problems!

The next official school contest will be on November, 6, at 14.00 MSK

Total number of participants is 788, 274 of them have taken part in the school competition.
 
 
 
 
  • Vote: I like it
  • +41
  • Vote: I do not like it

9 years ago, # |
  Vote: I like it 0 Vote: I do not like it
Will it be rated for everyone?
  • 9 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    Yes
    • 9 years ago, # ^ |
        Vote: I like it +1 Vote: I do not like it
      But why in the page http://codeforces.com/contestRegistrants/38 many people are considered out of competition?
      • 9 years ago, # ^ |
          Vote: I like it +12 Vote: I do not like it
        Don't worry. Round will be rated for them too.

        People, who are considered out of competition, are participants of Codeforces Round #38, others are participants of School Personal Contest #1.

        But we will use merged result table for updating rating.
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it
is intentionally the name of this post in russian?
9 years ago, # |
  Vote: I like it +1 Vote: I do not like it
Before start 01:41:19
Until closing 05:41:19

Is this possible?
  • 9 years ago, # ^ |
      Vote: I like it +9 Vote: I do not like it
    Why not?
    Registration is opened until the end of the contest, because ACM ICPC rules don't require rooms segmentation.
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it
Hey! I participated a few minutes because I didn't have enough time and I knew I was out of competition and now I see it's rated! You clearly said that we (the not-highschool people) were going to be OUT OF COMPETITION, and that clearly means UNRATED :(
  • 9 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it
    Look at this comment.
  • 9 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it
    By the way, when you registered for the contest it was written that it would be rated for everyone.
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it
im new to codeforces, i took part in the contest yesterday, solved three problems, i cant find my name on the standings list also i want to know if the solutions/algos for the other problems which i couldnt solve discussed anywhere?
9 years ago, # |
Rev. 2   Vote: I like it +3 Vote: I do not like it
In reply to jayesh02 :
You can click the square item on the right-upper corner of your screen which followed by "out of competetion".
The algo/solutions will be published a few days later, you can discuss them there.
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it
Does anyone know when the editorial will be published?
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it
Is there any blog with solutions for the harder problems?
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it
Is there any editorial published yet?
If not, will there be one?
  • 9 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it
    it is Codeforces Beta Round #38 (ACM-ICPC Rules)

    you can go this link
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Could someone give any idea for solving Problem H, The Great Marathon?