nxtbig's blog

Inviting all Competitive Programmers to Codecracker 2k17
By nxtbig, history, 8 years ago, In English

Hello Codeforces community!
I bring to you your Hogwarts letter.
I am glad to announce that Codecracker 2k17 will be held on 20th Jan 2017 at 16:00 UTC.
The problem statements will be available in English. The cash prize of the contest is Rs.20,000($300). Though what's priceless is solving interesting problems and the thrill of competition, prizes make the competition fierce. The contest will consist of 5 problems. We have tried our level best to set a balanced problem set. Hopefully, everyone will enjoy.
The theme of the contest is Harry Potter. So join us and feel the magic.
The contest is hosted on our own judge
Contest Link: http://codecracker.in/
Contest Details: http://mkti.in/events/codecracker/

Good luck and have fun!


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

Comments Comments (20)
| Write comment?
»
8 years ago, # |
  Vote: I like it +11 Vote: I do not like it

I am unable to login on the site. Using Google+ login gives me an error message saying "invalid credentials"

→ Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Too bad descriptions, simple and non-original questions. Done 4 — leaving 3rd question since test data seems to be wrong.

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

    True. Also, first question time limit is so strict! vector/map lovers are at a loss :(

    → Reply
    • »
      »
      »
      8 years ago, # ^ |
        Vote: I like it +5 Vote: I do not like it

      unengineering or chocolate frog cards? — i had both AC in < 0.6 secs. You are kahakaharegisterkaru ? :P

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

    Are you talking about "Potions"? I think you forgot the point that "Single member is not considered as a team".

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

      Yes. I took care of that. Can you share the judge solution?

      → Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Now, that the contest is over, can we see author's solution of p3?
PS: Don't make a Harry Potter fan write problems. The descriptions become too messy and hard to understand.

→ Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

how was omen done, i am getting an extra log factor for exponentiation?

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

please make all submissions visible

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

can someone show me the code for the first question i think i was getting tle for no apparent reason.thanks

→ Reply