By RussianCodeCup, history, 8 years ago, translation, In English

Hi, everyone!

There are already more than 400 participants who are preparing for the Elimination Round of Russian Code Cup 2017. If you are still among those who has not qualified yet, we invite you to take part in the Third Qualification Round that will take part this Saturday, April 29, at 14-00 Moscow Time. Top 200 participants will also qualify to the Elimination Round and will be able to compete to get to the Final Round of Russian Code Cup 2017.

Good luck and see you at russiancodecup.ru!

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

| Write comment?
»
8 years ago, # |
  Vote: I like it -19 Vote: I do not like it

Good luck to everyone, hopefully we will classify for the next round!

»
8 years ago, # |
  Vote: I like it -24 Vote: I do not like it

Thanks.Good luck

»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I am not able to submit solutions as "You are not registered to the round. So you can not send solutions.". Is there anyway to register after the round has started?

»
8 years ago, # |
  Vote: I like it +36 Vote: I do not like it
  • »
    »
    8 years ago, # ^ |
      Vote: I like it +93 Vote: I do not like it

    The problem is exactly the same, indeed.

    I am sorry about that, we made it from scratch. None of our writers or testers noted that they saw it before, although some of them, as I see now, indeed did participate in the corresponding round.

    There are tons of problems in the internet, so simple problems are almost certainly similar to some former ones. Of course, if we see exactly the same problem, we always replace one. We just didn't notice that this time.

    Hope it didn't affect most participants.

»
8 years ago, # |
  Vote: I like it +123 Vote: I do not like it

Is this 21st century? Can somebody confirm? I am not sure because I have just participated in a contest with a stack limit. Come on guys, it's pathetic.

  • »
    »
    8 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Hmm, I was doing recursive DFS in D, so it probably would have failed if there was a stack limit.

    Something else that I didn't like though was getting TLE in D, which I fixed using FastIO :)

    • »
      »
      »
      8 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      There was a stack limit, however a pretty big one as for existing stack limits — 64MB. I submitted on CF code that got RTE on RCC and it got AC using 96MB.

      • »
        »
        »
        »
        8 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Did you submitted on Visual C++? It seem to there are very strict stack limit on VC++, but isn,t on g++.

        • »
          »
          »
          »
          »
          8 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          No idea what is stack limit in Visual C++, but I submitted it in g++14 which is compiled with --stack=67108864 what means there is 64MB limit on stack.

    • »
      »
      »
      8 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Same here... But, sadly, I didn't pass D during contest even with FastIO and some optimizations.

      Code that got TLE on RCC got AC easily on CF in about 400 ms. Most frustrating is wasting more than one hour trying to make it fit in time limit.

»
8 years ago, # |
Rev. 2   Vote: I like it +25 Vote: I do not like it
»
8 years ago, # |
  Vote: I like it +57 Vote: I do not like it

Great, after learning that RCC has stack limit I also learned that I was constantly getting WA in E on test #2 because RCC is judged on Windows that has fu^&*# up rand() :/.

»
8 years ago, # |
  Vote: I like it +20 Vote: I do not like it