can some1 explain me the two test cases of this question.. http://mirror.codeforces.com/problemset/problem/9/D..

please explain me the approach to solve the problem http://mirror.codeforces.com/problemset/problem/6/D .... thanx in advance

please explain me the approach to solve the problem http://mirror.codeforces.com/problemset/problem/6/D .... thanx in advance

please explain me the approach to solve the problem http://mirror.codeforces.com/problemset/problem/332/B ..i read the editorial but couldnt understand the soln.. thanx in advance

i am unable to understand the test cases of this question http://mirror.codeforces.com/problemset/problem/265/C please explain this question using a test case thanx in advance

how can we print all possible subsequences of string using dynamic programming. for ex . for sequence 1,2,3 the possible subsequences are {1},{2},{3},{1,2},{1,3},{2,3},{1,2,3}

plz explain me how to approach this problem and the answer to this problem ..thnx in advance :)

can anybody plzz tellme wats wrong in the following code http://ideone.com/DPnQRq its giving wrong ans on pretext 10 plzzz reply

what is the maximum size of array that is permissible in c++?? can't we use an array of size 10^9 ..plz reply

how can we compute the numbers of the series 2 ,4,6,10,14,22,30,46 .. for a number as large as 10^9 ?? here is my code http://ideone.com/0fuDO but it is too slow ..plz suggest me some faster method