Monthly Archives: March 2014

SRM-613(Div-2) 1000

Problem Statement Solution Analysis Code: Advertisements

Posted in Favorite Problems, TopCoder

An Easy DP Problem-2 with Bitmask

Given N integers. Let Total subsets T=2N. How many subsets are available from T where the distinct integers are less than or equal to K. Sample Input: 4 2 (N,K) 1 2 3 4(A[i]) Sample Output: 11 Sample Input: 4

Posted in Dynamic Programming

Project Euler 16

What is the sum of the digits of the number 2^1000?

Posted in Number Theory, Project Euler