### hmehta's blog

By hmehta, history, 9 months ago, ,

Topcoder SRM 747 is scheduled to start at 11:00 UTC -5, Jan 19, 2018. Registration is now open for the SRM in the Web Arena or Applet and will close 5 minutes before the match begins

This is the fifth SRM of Stage 2 of TCO19 Algorithm.

Hope to see most of you competing! All the best!

• +45

 » 9 months ago, # |   0 Reminder: Match begins in around 1 hour from now!
 » 9 months ago, # |   +19 So boring. I feel like I participated in div. 2 contest.
•  » » 9 months ago, # ^ |   +9 You solve div II easy for 75 points? < /stalker >
 » 9 months ago, # |   +29 This time, double/long double works on 500.
 » 9 months ago, # |   +6 My screencast: https://youtu.be/EUP-kY-sZ18
 » 9 months ago, # | ← Rev. 2 →   0 Is there any EASY way to solve recently Completed Contest(I mean to submit codes)?
 » 9 months ago, # |   +3 Any hint on the main idea of DivI 500 — the maximum ties?
•  » » 9 months ago, # ^ |   +3 DP: dp[t][p][mx][cnt] = answer if we have t tokens and p piles to put them and maximum of piles is mx and number of ties in maximum is cnt.
•  » » » 9 months ago, # ^ |   +3 No reason to not make last dimension binary
•  » » » » 9 months ago, # ^ |   +11 Hello, how would the state transition be then?I only understood the solution of tourist, which is a monotonically increasing dfs pile generation.
•  » » » » » 9 months ago, # ^ | ← Rev. 4 →   -26 I hope that my code should be self-explanatory (newt[i][j] is obviously Newton's symbol (i choose j) and pr is a probability that we out here coins to last stack out of prvt + here coins)(you may want to open it in separate tab to make it larger)
 » 9 months ago, # |   0 Auto comment: topic has been updated by hmehta (previous revision, new revision, compare).