Hello guys... http://www.spoj.pl/problems/POCRI/
this problem is using a variant of josephus problem. in josephus we for given n persons in a circle we start killing every kth person and last person remaining is the survivor......kth 2kth 3kth.......so on i solved it using *f(n,k)=(f(n-1,k)+k)%m nd dp...* * * nw in its variant which is the spoj problem we have to kill evert kth person but we have to start by killing 1st den (k+1)th den(2k+1)th so on i m nt able to modify the above problem........ plzz help -- HARSHIT PAHUJA M.N.N.I.T. ALLAHABAD -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
