SPOJ 6125. Dos Date February 21, 2010

SPOJ 6125. Dos Date(challenge)
Problem code: DDATE

—AC—

j,k,N,X,l,y,d,m,r;*o[]={"January","February","March","April","May","June","July","August","September","October","November","December"};
main(){scanf("%d",&N); while(N--){scanf("%d",&X);j=k=l=d=m=y=0;while(X){r=X%2;(j<5)? (d+=r*pow(2,j++)):(k<4)?(m+=r*pow(2,k++)):(y+=r*pow(2,l++));    X/=2;}printf("%d %s %d\n",d,o[m-1],y);}exit(0);}

SPOJ 127. Johnny Goes Shopping December 8, 2009

SPOJ 127. Johnny Goes Shopping (Challenge)
Problem code: JOHNNY
–AC– ( but less points)

proceedure:
find the sum half it and then sort the array and accordingly store the positions and then find the sum of the sorted array which is nearest to half the sum of weights.