Hi Guys can someone tell me how to approach this problem ? @vijju123 @taran_1407 @vivek_1998299 @meooow @john_smith_3 @aryanc403 @vbt_95 NOTE : This question is not from an ongoing contest. It's a past contest problem :) asked 04 Aug '18, 20:00

You are not logged in. Please login at www.codechef.com to post your questions!
×CodeChef Discussion 
Hi Guys can someone tell me how to approach this problem ? @vijju123 @taran_1407 @vivek_1998299 @meooow @john_smith_3 @aryanc403 @vbt_95 NOTE : This question is not from an ongoing contest. It's a past contest problem :) asked 04 Aug '18, 20:00

Once you sign in you will be able to subscribe for any updates here
By RSS:Markdown Basics
Question tags:
question asked: 04 Aug '18, 20:00
question was seen: 194 times
last updated: 06 Aug '18, 23:59
someone on this ?
please someone help on this?????
use dp
dp[n][k][lastElement][Number] denotes count of all k distinct partitions of n(where we represent partition only in increasing order to avoid the permuatation issue),lastElement is the lastElement in all those partitions,and Number says how many of the elements in those partitions are a square(u can restrict this case to two)