Can anybody provide me an optimized approach on how to find the sum of all subsets of a set. suppose my set is {a, b, c}. So subsets are — {a}, {b}, {c}, {a,b}, {a,c}, {b,c}, {a,b,c}. I want to find a + b + c + (a + b) + (a + c) + (b + c) + (a + b + c). Thanks in advance.

How can we solve this problem — SEQ ??

Why do unsigned integers wrap without extensively using the modulo operator in c++?? Suppose , Unsigned int a , b; a and b both are 2^32-1. Then what will be the value of a+b?

so if they don't overflow how can we make them overflow??

Can anybody explain me the concept of difference array??

Can someone please explain why we are taking the median element given in the editorial ?? And The Mathematical proof....I can't Understand...

Question — Your text to link here...

Editorial — Your text to link here...

the Editorial say's there's a O(n^2m^2) Soln...

I have a soln which is O(n^2m^2) — Your text to link here... ....but it is giving TLE....

133B — Unary

In the Editorial of The Problem 133B — Unary.......It is given to multiply by 16 and then add...i can't Understand Why to multiply by 16.....can anybody help????

Editorial Link — http://mirror.codeforces.com/blog/entry/3302

And why is this soln giving me negative decimal value for large binary value...Please help if i can correct my soln..

my soln — Your text to link here...

why ami i getting Tle .... Question — Your text to link here...

My Soln -Your text to link here...

Please Help....