CareerCup

@ YANG... assuming M is just a string ...meaning char *M = "100101110100101"

then pointer to string N say char *N = "10110"..

Now check for boundary condition.. ie
if(p>=0 && p<=strlen(M) && p<=q && q<=strlen(M) && q>=0)
if successful then check if(q-p == strlen(N)) if successful
increment M by (p-1) so as to make it point to pth bit in the string M.. i.e. M+=(p-1);
then in a loop
while(*M!= '\0' && *N!= '\0') // loop till end of string N and copy into string M
{
*M++ = *N++;
}

I am assuming M to be of 4 bytes & N to be of 1 byte (if that is not the case then we will have to look for iterative solution)

int M1 = 0;
take another array suppose M1. Initialize it with 0.

Then copy N left shifted by to M1 and then "&" it with M. This will make all bits in M that are 1 and those are NOT 1 in N as 0.
M1 = M & (N<< ( 1<<p));

After that copy N to M.
M = M | (N << (1 << p));

Manipulate(M,N,p,q)
{
M=M&((N<<p+q)>>q);//if q>p
M=M|((N<<p+q)>>q);
}

1. Mask bits between p & q(bitwise & operation).
2. then apply or (|) operation with N.

1. bit makes between p & q and process the M
2. shit N ( N << p)
3. use "or " to get the final restuls
M | ( N << p)

int a = ((N << (32-q+p))>>(32-q))
int b = (M>>q)<<q
int c = (M<<(32-p))>>(32-p)

M = a|b|c