Bit Operation

//Abinash Ghosh(Om)
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <climits>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <sstream>
#include <algorithm>
using  namespace  std;

#define PI acos(-1.0)
#define MAX 10000007
#define EPS 1e-9
#define mem(a,b) memset(a,b,sizeof(a))
#define gcd(a,b) __gcd(a,b)
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define Sort(x) sort(x.begin(),x.end())
#define FOR(i, b, e) for(int i = b; i <= e; i++)
#define pr(x) cout<<x<<"\n"
#define pr2(x,y) cout<<x<<" "<<y<<"\n"
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)

typedef  long long ll;
typedef  pair <int, int> pii;
typedef  pair <double , double> pdd;
typedef  pair <ll , ll > pll;
typedef  vector <int> vi;
typedef  vector <pii> vpii;
typedef  vector <ll > vl;
//int dx[]={1,0,-1,0};int dy[]={0,1,0,-1}; //4 Direction
//int dx[]={1,1,0,-1,-1,-1,0,1};
//int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
//int dx[]={2,1,-1,-2,-2,-1,1,2};
//int dy[]={1,2,2,1,-1,-2,-2,-1};//Knight Direction

int setbit(int  N,int pos){return N=N|(1<<pos);}
bool checkbit(int N,int pos){return(bool)(N&(1<<pos));}
int resetbit(int N,int pos){return N=N&~(1<<pos);}

void buildin()
{
    int x=28;
    printf("Index of least significant bit:%d\n",__builtin_ffs(x)-1);
    printf("Number of leading zeroes :%d\n",__builtin_clz(x));
    printf("Index of highest set bit:%d\n",31-__builtin_clz(x));
    printf("Number of trailing zeroes :%d\n",__builtin_ctz(x));
    printf("Number of 1-bits:%d\n",__builtin_popcount(x));
    printf("Parity:%d\n",__builtin_parity(x));
}

int main()
{
    //READ("in.txt");
    //WRITE("out.txt");
    int n=3;
    printf("%d",resetbit(n,0));
    return 0;
}