What was this ?

general
21

this and this, similar to Jealous Numbers

22

How you solved the 4th one?

23

@thezodiac1994. i tried a lot, can you give link to your solution if did using linear diophantine way? My solution link: https://www.codechef.com/viewsolution/10561001

24

What is your approach to find the sum closest to sum/2. I tried the standard dp but got tle and couldnā€™t fix it until the end of contest. :confused:

25

@pranavarora - simple subset sum solution - for(i=0; i<n; i++) { for(j=MAX; j>=a[i]; jā€“) possible[j] |= possible[j-a[i]] }

26

If you donā€™t mind, can you please share the code?

27
1 Like
28
  1. make a set of east west moves. call sum of this set as sum1.
  2. make a set of north south moves. sum of this set = sum2.
  3. find closest sum of subsets to sum1/2 and sum2/2 in sets 1 and 2 and add them.
29

https://www.cs.cmu.edu/~adamchik/21-127/lectures/divisibility_5_print.pdf

Read the part on positive solutions.

my soln - https://www.codechef.com/viewsolution/10553009.

30

Can anyone provide solution to vCake problem? I solved all possible cases, yet it gave me ā€œWrong Answer!ā€ā€¦ not sure whyā€¦

31

@giorgosgiapis For COLTREE my approach. Suppose you choose i colours to use (nCr(k,i) ways), then you need to partion the tree in i different units that can be done simply by selecting any i-1 edges (nCr(n-1,i-1) ways ) and then arranging the i colors (i! ways). Sum over this from i = 1 to i =min(k,n).
I got WA once because I sumed from i = 1 to i = k, may be that would have been the case for you as well.
Thank you.

32

Thanks! :slight_smile:

33

Hereā€™s my solution for the VCake problem.link text
Would be helpful if someone posts the solution for the second one.

34

Can anyone give the solution for color tree ?

35

In the problem VCake can someone clarify what is meant by the line:
They want their pieces to be connected (in one piece), and rectangular in shape.
Does that mean that each piece should necessarily share its boundaries with other two pieces?

If thats the case then what is the problem with this solution?

36

Can you please upload it on ideone @thezoidac1994. They have not made solution visible yet. Edit: this was my code: http://ideone.com/DsTMC7

37

Please someone post the solution for color tree

38

Can anybody help me out with jealous number question?
I tried a lot but couldnā€™t crack the logic :frowning:

39

@sam5125 Your solution will fail this case: 4 5 10 5 5. You missed the case where every piece can be parallel to one side of the rectangle.

40

Here is my solution to 2nd problem:
Chocolate Solution

Can anybody look to my solution of VCake. It is giving me WA and I have considered every possible combination to ensure it does not miss any case. Thanks
Cake solution