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

Автор shashank21j, 10 лет назад, По-английски

Hello Coders!

I invite you to participate in HackerRank's weekly contest.
Link http://hackerrank.com/w9
Starting today 25th August 16:00 UTC there will be 1 challenge posted daily in increasing order of difficulty.

Penalty will be (Submit — View) time, which allows you to start late. But if you delay by 24 hours 10% score gets decayed per day. More rules can be seen here

With new addition to our leaderboard you can see the time penalty on the leaderboard itself Example

Contributors
Day 1 & 2: amitp08
Day 3: shaka_shadows
Day 4: viv001
Day 5: CherryTree

P.S. For contribution you can contact me or mail to: hackers [at] hackerrank [dot] com

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

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

1 shubhamutwal 30.00 0:07 India

2 nishit 30.00 0:20 India

Well, I'm quite sure that it's impossible to read the statement and type sufficient number of characters in 20 seconds. This penalty system (submit — view) is nice, because it allows people to participate when they have some free time, but I hope that organizers will disqualify people who definitely do not play fair.

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

    You know, the so-called Internet superheroes...

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

    I think the most probable cause is they spent time writing a script that can parse HTML, read the problem statement and write code that solves it according to a builtin database of algorithms. In fact, given how heroic this task is, they should be just awarded the contest win right away for their accomplishments and contribution to artificial intelligence.

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

    Why do you think we took all the pain to display penalty? :)

    Right now all these are looking funny/fools and will be scrutinised for copy and other things and eventually disappear from leaderboard.

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

    Cleaned Day 1 and Day 2 :)

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

Lol, it's awesome how the number of participants is roughly halved for each problem after its day has passed :D

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

Nice problems. Nice week. Nice contest.=)

How to solve "Alex vs Fedor"?

For finding count of spanning trees we can use Kirchhoff theorem.

But how finding count of MINIMAL spanning trees?