Блог пользователя belowthebelt

Автор belowthebelt, история, 8 лет назад, По-английски

Hello, Codeforces Community!

I invite you to June Easy '16. The contest starts on Wednesday, June 1, 2016 16:00 UTC and will run for 3 hours. The difficulty of the contest will be similar to a div-2 CF round. The problems have been set by Yury_Bandarchuk,

A lot of you can manage to solve all the 6 problems in 3 hours, for sure. The order of the problems will be random. Each problem is worth 100 points but scoring is partial so try to pass as many tests as possible!

Also, I want to thank Prateek Xsquare — he is the tester and editorialist for the contest. It was amazing to work with both of them.

Link: https://www.hackerearth.com/june-easy-16/

Enjoy the contest, guys. See you all on the hall of fame!

P.S. There is an exciting feature release related to our code editor before this challenge. Hint: Ever wondered how fast you could get an AC if your favourite language and template is preloaded in the editor?

PPS: We know about the clash with CF-round. But, Easy has always been happening on the first day of the month, and we could not do anything this time to avoid this clash. We apologize in advance for that. We'll make sure to avoid such conflicts in future!

  • Проголосовать: нравится
  • +44
  • Проголосовать: не нравится

»
8 лет назад, # |
  Проголосовать: нравится +15 Проголосовать: не нравится

From what I understand your intention was to run a June easy contest but it ended up being June clash! PS: Also you have provided the link to January-easy.

  • »
    »
    8 лет назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    Updated the link to June-easy, sorry about that. How did you decipher the June Clash part from the post, by the way?

    • »
      »
      »
      8 лет назад, # ^ |
        Проголосовать: нравится -21 Проголосовать: не нравится

      "We know the clash with CF-round" :)

      • »
        »
        »
        »
        8 лет назад, # ^ |
          Проголосовать: нравится 0 Проголосовать: не нравится

        Its interesting that my original post got up voted but an explanation on the post got down voted! Sometimes the community behavior is beyond my comprehension!

»
8 лет назад, # |
  Проголосовать: нравится +1 Проголосовать: не нравится

26 minutes to go, good luck! :)

»
8 лет назад, # |
  Проголосовать: нравится +4 Проголосовать: не нравится

Nice challenges, the contest finally was indeed "Easy" but still interesting.

»
8 лет назад, # |
  Проголосовать: нравится +11 Проголосовать: не нравится

"TOP 5 beginners get T-shirt". How to check if someone is a beginner? / How to check who got T-shirts?

»
8 лет назад, # |
  Проголосовать: нравится +1 Проголосовать: не нравится

Hello everyone!

I want to hear your feedback about the problems.

Thanks.

  • »
    »
    8 лет назад, # ^ |
      Проголосовать: нравится +6 Проголосовать: не нравится

    I want to have a feedback about my question above ;)

    The problemset was really much more appropriate than previous Month 'Easy' rounds.

    What I didn't like was E — definitely one of "Well known" problems. And if someone didn't know, googling was enough to score 100 pts easily.

    F was quite standard too, but it's okay. My favourite problem was D, maybe cause it's the one I couldn't solve. Easy problems (A, B) were suitable.

    And C.. Well.. Personally, I am very weak at tasks like this, so it took me much time to solve C. Was it easier than I think?

  • »
    »
    8 лет назад, # ^ |
    Rev. 2   Проголосовать: нравится 0 Проголосовать: не нравится

    In problem "benny-and-shopping"(A) it wasn't clear for me what should be the answer for this input

    1

    $123 123hello

    I think it should be $123, my AC code gives $123123, but I guess there are no tests of this kind in the input (strings beginning with numbers) and it wasn't clear from statement what should we consider.

    In problem "benny-and-subsets"(E) I would like to have known the constraints on X, which were not stated.

    Besides that I liked the problems.