CODETALK

Posts

Showing posts from July, 2015

Solution for SAMER08F problem in SPOJ.

problem link- http://www.spoj.com/problems/SAMER08F/ #include<stdio.h> #include<math.h> int main() { int n,i,sum=0; while(1) { scanf("%d",&n); if(n==0) break; for(i=1;i<=n;i++) sum=sum+ pow(i, 2); printf("%d\n",sum); sum=0; } return 0; } this problem can be done without using loop.

Write a program to swap odd and even bits in an integer with as few instructions as possible (e.g., bit 0 and bit 1 are swapped, bit 2 and bit 3 are swapped, etc).

#include<stdio.h> main() { int n; scanf("%d",&n); printf("%d",( ((n & 0xaaaaaaaa) >> 1) | ((n & 0x55555555) << 1) )); }