You are not logged in. Please login at www.codechef.com to post your questions!

×

Can anyone help me with Distinct Partition Squares from TCS Mockvita 2018 Contest?

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

harrypotter0's gravatar image

4★harrypotter0
318110
accept rate: 1%

someone on this ?

(05 Aug '18, 08:45) harrypotter04★

please someone help on this?????

(06 Aug '18, 23:59) harrypotter04★
1

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)

(07 Aug '18, 12:30) vivek_19982996★
toggle preview
Preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:

×2,718
×2,355
×1,236
×20
×13

question asked: 04 Aug '18, 20:00

question was seen: 194 times

last updated: 06 Aug '18, 23:59