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

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

Throughout the year, Google Code Jam hosts online Kickstart rounds to give participants the opportunity to develop their coding skills, get acquainted with Code Jam’s competition arena, and get a glimpse into the programming skills needed for a technical career at Google.

Each Kickstart round gives participants 3 hours to solve challenging, algorithmic problems developed by Google engineers. Participating is a fun way to grow your coding skills—and potentially explore opportunities at Google.

Inviting you to solve some fun and interesting problems on Sunday, Oct 21, 2018 13:00 UTC (24 hours from now).

Dashboard can be accessed here during the contest. Problem analysis will be published soon after the contest.

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

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

BUMPing this. Contest starts in about half an hour :)

»
8 лет назад, скрыть # |
Rev. 2  
Проголосовать: нравится +3 Проголосовать: не нравится

The boring preprocessing of the problem 2 killed all the fun. :/

By the way, how to solve it for large? Does binary search work for the small?

»
8 лет назад, скрыть # |
Rev. 37  
Проголосовать: нравится +9 Проголосовать: не нравится

Thanks to everyone who participated in Google Code Jam Kickstart Round G today.

Analysis is available here.

Congratulations to the top placers, and special congratulation to Reyna to finish the contest in 1h22m and winning it.

There will be only one more Google Code Jam Kickstart round left this year. Round H will be held on November 18, 5am UTC. See you in Round H :)

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

I got Rank 47. Any hope for me of getting a call for recruitment from Google ?

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

I am not getting how to convert the compressed scores back to actual values. Can anyone elaborate the last line in problem B's analysis — "However, note that the answer is not exactly x, since we compressed the scores earlier. The exact details of the implementation are left as an exercise."