LoneFox's blog

By LoneFox, history, 6 years ago, In English

The Qualification Round of the 2018 Facebook Hacker Cup is less than 24 hours away!

The round will begin on July 6th, 2018 at 4pm PDT and will last for 72 hours (3 days). You can check the start time in your local timezone here.

The contest will be available here shortly before the round begins.

Everyone who solves at least one problem correctly will advance to Round 1, which will take place on July 21st. Please note that all submission judgements will only be revealed after the round ends. More details about rules and other information can be found here.

Registration will remain open until the end of the Qualification Round, so make sure to register if you haven't already, or confirm that your information is up to date if you have.

We wish you the best of luck, and hope that you enjoy the contest!

The corresponding Facebook post can be found here.

Update: The editorial is now available here.

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

| Write comment?
»
6 years ago, # |
  Vote: I like it +26 Vote: I do not like it

So there's no longer t-shirt as prize(not like they actually send it anyway)?

  • »
    »
    6 years ago, # ^ |
      Vote: I like it -60 Vote: I do not like it

    As per the FAQ linked above, the top 500 finishers from Round 2 will get t-shirts, as in previous years. The delivery process will also be improved to include sharing tracking numbers.

    • »
      »
      »
      6 years ago, # ^ |
        Vote: I like it +188 Vote: I do not like it

      Oh, you mean that you actually sent them last year? Oh great, now there are 475 postmen wearing FBHC shirts walking around!

      How about trying a different delivery method?

»
6 years ago, # |
  Vote: I like it +29 Vote: I do not like it

Welcome to Facebook No-shirt Cup.

  • »
    »
    6 years ago, # ^ |
      Vote: I like it +86 Vote: I do not like it

    No-shirt Cup? This sounds braver than even Wet Shirt Cup.

    • »
      »
      »
      6 years ago, # ^ |
        Vote: I like it +31 Vote: I do not like it

      Let's hope some girls qualify to the finals!

»
6 years ago, # |
Rev. 2   Vote: I like it +3 Vote: I do not like it

[Deleted]

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

The link don’t work :/

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

    Which link? Are you using a phone or desktop?

»
6 years ago, # |
Rev. 2   Vote: I like it -51 Vote: I do not like it

Solved

»
6 years ago, # |
  Vote: I like it -10 Vote: I do not like it

i think qualification round and round1 should not have such a great difference in the problem difficulty... just concerned about great number of qualifiers ...and less than half clear round 1 ...make newbies dream big and push them from high..XD

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

Your output is formatted incorrectly. Please make sure that you're uploading the correct file, and that you're matching the expected output format exactly.

What it is???

  • »
    »
    6 years ago, # ^ |
      Vote: I like it +126 Vote: I do not like it

    I think that's because your output is formatted incorrectly.

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

    take care that you dont print any extra lines or spaces , check carefully , it will be fixed, happens a lot to me.

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

      In what format should the output file be?

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

        .txt works..

        Advice:

        I also was unsure of how to submit, so you can try to experiment a LOT with previous year problems , you can submit witout a time window there , so you can clear wall your submitting related doubts from there, thats what I did..

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

    ran into this problem too. I guess that's because of CR+LF line endings.

»
6 years ago, # |
  Vote: I like it -10 Vote: I do not like it

Hm, I thought problem C was as simple as looking for another occurrence of A[0] and then repeating the section from A[0] to the second occurrence, but that gave WA. Anyone wanna share the solution?

»
6 years ago, # |
  Vote: I like it +15 Vote: I do not like it

Lol my C failed because I printed "IMPOSSIBLE" instead of "Impossible".