Am i the only one who couldn’t solve any problem

Frustrated.

# What was this ?

Beleive me you are not. Problem set was harder than last years without any cakewalk problem!

I solved one in 26 mins, then it took me 21 wrong tries. And it was like, “What am I doing with my life!”

And the 21 went in vain.

I think problems weren’t hard this time but a lot trickier, even though I could solve only 2 problems (VCAKE and COLTREE) , in COLTREE only n and k were required and not the structure of the tree.

I think solutions of first 4 problems won’t be more than 10 lines of code.

Did anyone solve the second question , “Chocolate for Everyone” ?

Spent 2-3 hours trying euclid’s method and what not , to no avail !

**mantu2126**#7

can any one tell me how you solved 2nd one ? I formed the equation in ax+bx=c after that I used the condition

if(c% gcd(a%b) ) is true then yes …

**timaredoc79**#8

The problems were easier than last year’s:

I solved the following:

- VCAKE: only 2 possible cake cuts: make cases.

- ARITHM: see equation of sum and cases on whether n is odd or even.

- COLTREE: no tree required: just f(n,k) simple DP.

- RWALK: subset sum - hit nearest to sum/2.

The above 4 were not more than 20 lines.

- SEGSUMQ - simple range sum query on persistent segtree(tedious to code)

Though I did not solve NUMSET, it should be doable by max-flow or some MIS algorithm for such special graphs.

**ketn**#10

Can anyone provide solution to vCake problem? I solved all possible cases, yet it gave me “Wrong Answer!”… not sure why…

**ashutosh_cric**#11

Here’s my solution for the VCake problem.link text

Would be helpful if someone posts the solution for the second one.

**sam5125**#13

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?

**codebreaker_2**#14

Can anybody help me out with jealous number question?

I tried a lot but couldn’t crack the logic

**maulik137**#15

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][1]**yashokirti16**#16

Second question was pattern based. when n is odd, sum should be divisible by n for a ‘Yes’. If the n is even then: temp1=a*n+(n-1)*(n)/2 and temp2=a*n+(n-1)*(n). These are the sum of first n terms in the AP with common diff=1 and 2. Now (sum-temp1)%n or (sum-temp2)%n should be 0 for a ‘Yes’.

**saurabhsuniljain**#18

I think problems weren’t hard this time but a lot trickier, even though I could solve only 2 problems (VCAKE and COLTREE) , in COLTREE only n and k were required and not the structure of the tree.

I think solutions of first 4 problems won’t be more than 10 lines of code.

**saurabhsuniljain**#19

Can you please explain 2nd problem, could not get it even now, what I understood was, you are given sum of A.P and number of terms in the A.P and you want to know whether a positive integer A.P exists or not with such property.

**tasatasa**#20

Well, you want to solve Nx+d*(N-1)*N/2 = C where x and d >=1, u have 2 cases if N is even or odd