Hi, most of us are aware of a classical assignment problem. It involves use of dp+ bitmasking. Now if the number of subjects increased to 80(instead of 10 which was equal to number of students) such that the number of students =10 and no of subjects =80. Can anyone help me in coming up with a bottom up solution?

Tin Cutter This problem involves coordinate compression. I am not able to figure out how coordinate compression can be applied to this problem.

Can Z algorithm be used to solve any problem which involves use of failure function? I find Z function to be more intuitive than failure function. How Z algorithm can be used to solve

https://www.codechef.com/problems/SCC0102