Need Help In solving ACM ICPC regional Problem

Revision en1, by st0ur, 2016-12-23 13:13:51

I was trying to solve this question which was asked in the ACM ICPC Amritapuri regional today morning.

Click here

Both the main and the mirror contests have ended .

The only conclusion which I made is that the growth of the numbers is exponential and hence the maximum number of elements cannot exceed 60 and this is a subset sum problem.

Any hints on how to approach this problem would be appreciated.

Thanks

Tags help needed, #acm-icpc amritapuri, subset sum

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English st0ur 2016-12-23 13:13:51 523 Initial revision (published)