Uploaded January 2020 | Updated September 2026, 2 days ago
Post-Contest discussion stream for CodeChef January Cook-Off 2020
06:15 CHFCHK
08:00 EXAMCHT
10:50 RGAND
17:55 CFINASUM
29:10 PRT
38:10 PLIND
48:10 CNTIT
Screencast during the contest: youtu.be/JYjnNvEPvt4
Comments, questions, requests, criticism, are all welcome!
I made a mistake while explaining PLIND: dp[i][j] is actually the number of ways to choose suffix of length i such that the prefix has j digits occurring an odd number of times.
Post-Contest discussion stream for CodeChef January Cook-Off 2020
06:15 CHFCHK
08:00 EXAMCHT
10:50 RGAND
17:55 CFINASUM
29:10 PRT
38:10 PLIND
48:10 CNTIT
Screencast during the contest: youtu.be/JYjnNvEPvt4
Comments, questions, requests, criticism, are all welcome!
I made a mistake while explaining PLIND: dp[i][j] is actually the number of ways to choose suffix of length i such that the prefix has j digits occurring an odd number of times.
