CareerCup

int modifyInt(int n,int a, int b, int k)
{


}

int modifyInt(int n, int a ,int b, int k )
{

int temp1,temp2;
temp1=n;
n=n>>(b+1); /*right shift the number by b+1 bits
n=n <<(b+1);
/* left shift the above result by b+1 bits - this makes the last b+1 bits of n zero */
k=k >> a;
/*now right shift k by 'a' bits */
temp2=temp1 << (8*sizeof(int)-a);
temp2=temp2 >>(8*sizeof(int)-a);
/*temp2 now holds the value of the last 'a' bits of n */
temp1=temp1 | k;
/*this replaces the b+1 bits of n with k - now we need to shift this by a bits and concatenate with a to retain the original 'a' bits */
temp1= temp1 << a;
temp2=temp2 | temp1;
return(temp2);
}

int modifyInt(int n, int a ,int b, int k )
{

int temp1,temp2;
temp1=Oxffffffff;
temp1=temp1>>(a); /*right shift the number by a bits
temp1=temp1<<(a);
/* left shift the above result by a bits - this makes the last
a bits of n zero */
temp1=temp1<<(8*sizeof(int)-b);
temp1=temp1>>(8*sizeof(int)-b);
temp1=NOT(temp1);//invert the 1's and 0's
n=n&&temp1;
/*now right shift k by 'a' bits */
temp2=k << (a);
n=n||temp2;
return(n);
}

i/p = n;//A and B start from 0
o/p = (1<<A)|((n|((((1<<B)-1)*2+1)^((1<<A)-1)))&(((((1<<B)-1)*2+1)^((1<<A)-1))^~0));

i/p = n;
o/p = n|((n&~(((1<<A)-1)^(((1<<B)*2)+1)))&(k<<A));

mask = (1<<B-A+1) - 1; // make the mask
N |= mask << A; // set all bits to 1 between A and B
N &= k << A; // set all bits between A and B to K

i,j bit positions

int i=2;
int j=3;
int stripe=j-i+1;
unsigned int L= (N>>(j+1)) ;
N=(((L<<stripe)|M)<<i) | (((N>>i)<<i)^N);

#include <stdio.h>
int main() {
    unsigned num = 8;
    unsigned int a = 4;
    unsigned int b = 7;
    unsigned int k = 5;
     unsigned int mask;
     int r =0;
    mask = ((unsigned int)~0<<a) & ((unsigned int)~0>>(31-b));
    k = ((unsigned int)k<<a);
    printf("%d\n",k);
   // printf("%d %d\n",k,mask);
    r = (num & ~mask) | k;
    printf("%x",r);

int updatebits(int n, int m ,int i , int j){
    //create mask
    int allones =~0;
    int left = allones<<j;
    int right = (1<<i) -1;
    int mask = left|right;
    
    int n_cleared = n&mask;
    int shifted_m = m<<i;
    return n_cleared|shifted_m;
}