shashank21j's blog

[HackerRank] Weekly 9th edition
By shashank21j, 10 years ago, In English

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

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

»
10 years ago, # |
  Vote: I like it +28 Vote: I do not like it

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.

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

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

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

    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.

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

    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.

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

    Cleaned Day 1 and Day 2 :)

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

      Very effort, much appreciate.

      Wow.

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

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

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

    And time penalties for each problem are roughly doubled.

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

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?

→ Reply