CareerCup

If N is the input, N&15 will give you its mod 16.

Which company is asking these questions? Is it a phone interview? What position?

Here is the complete program:

#include <stdio.h>
int mod16(int);
void main()
{
	int no=33;
	printf("%d",mod16(no));
}
int mod16(int no)
{
	return no & (16-1);
}

We can use fmod which returns the remainder of a division
eg.
fmod(N,16)

use bit shift
int mod(int N)
{
return N-((N>>4)<<4);
}

n & 0xf

None of the answers are correct :((

sorry..i take by my comment :)

n&15

Just the jast 4 digits in the binary representation should be it.

int returnMod(int arg){
  arg|=0xF0;
  arg&=0x0F;
  return arg;
}

Basically what Nitish Gupta said, last 4 bits of the binary rep.

and

public int mod_16(int num){
		
		if(num < 16)
			return num;
		return mod_16(num-16);
		
	}


}

You can use same code as given in one of the answers but since * / - + isn't allowed,use >> and ^

int mod(int N)
{
return N^((N>>4)<<4);
}

int main(){
	int num;
	cin>>num;
	cout<<(num&15)<<"\n";
	return 0;
	}

int main(){
	int num;
	cin>>num;
	cout<<(num & 15)<<"\n";
	return 0;
	}

cout << N - (N/16)*16;

A little hard but use the STL to convert the int to a bin number without arithmetic, then search for '1000'.