Well learning bit manipulation helped in today's codechef may-14 lunchtime solved 2/4 questions
1) problem 1 :- APPROX2
this was brute force O(n^2) algorithm to fit the time limit  :-) this is my solution
my solution
2) problem 2:- DIVSUBS
i was able to solve the problem partially ;-) 37/100 points i got i don't know why i got SIGSEGV at higher tests :(
my solution 2
and now some good news i stood 114th on the list

here is the  ranklist

yaay....... but still :P no studies for Introduction to programming end semester gotta study now