随笔分类 -  位运算

摘要：int a; scanf("%d",&a); for(int i =0;i>i)&1;//从右往左第i位是x ，i==0，就是第一位 printf("%d ",x); } 阅读全文

摘要：ll ans=3*(1<<3); printf("%lld\n",ans); 24 int k1 =3,k2=3; k1<<=1; k2>>=1; printf("%d %d\n",k1,k2);//6 1 阅读全文

摘要：#include #include #include #include #include #include using namespace std; #define ll long long const int N =1e5+9; int t,n,a[N]; int b[50]; /* 要想两个数的异或结果比两者都大 必须两数的首位都为1，其他位... 阅读全文

摘要：128536K E. AC Challenge Dlsj is competing in a contest with n (0 < n \le 20)n(0<n≤20) problems. And he knows the answer of all of these problems. Howe 阅读全文