Codeforces 467(#267 (Div. 2) ) 解题报告
2014-09-19 12:24
405 查看
A:wa了3次 ,也是醉了 乱搞
View Code
// File Name: b.cpp // Author: darkdream // Created Time: 2014年09月18日 星期四 23时36分10秒 #include<vector> #include<list> #include<map> #include<set> #include<deque> #include<stack> #include<bitset> #include<algorithm> #include<functional> #include<numeric> #include<utility> #include<sstream> #include<iostream> #include<iomanip> #include<cstdio> #include<cmath> #include<cstdlib> #include<cstring> #include<ctime> #define LL long long using namespace std; int a[10005]; int n , m , k ; int isok(int x) { int t = 0 ; while(x) { if(x & 1) { t++ ; } x >>= 1; } if(t <= k ) return 1; return 0 ; } int main(){ scanf("%d %d %d",&n,&m,&k); for(int i =1 ;i <= m+1;i ++) { scanf("%d",&a[i]); } int num = (1 << n)-1; int sum = 0 ; for(int j = 1;j <= m;j ++ ) { int temp = a[m+1]^a[j]; if(isok(temp)) sum ++; } printf("%d\n",sum); return 0; }
View Code
相关文章推荐
- Codeforces 450(#257 (Div. 2) ) 解题报告
- [Codeforces]Round246 div2 解题报告
- codeforces_235_div2解题报告
- Codeforces 459(#261 (Div. 2) ) 解题报告
- Codeforces 474(#271 Div 2) 解题报告
- Codeforces Round #267 (Div. 2) 解题报告
- Codeforces 486(#277 Div 2) 解题报告
- codeforces 338(Div 2) B. Longtail Hedgehog 解题报告
- [Codeforces]Round246 div2 解题报告
- codeforces_240_div1解题报告
- Codeforces 471 Div2 B 解题报告
- Codeforces 448(#256 (Div. 2) ) 解题报告
- codeforces_229_div2解题报告
- Codeforces 451(#258 (Div. 2) ) 解题报告
- codeforces_233_div2解题报告
- Codeforces 441 (Div.1) 解题报告
- Codeforces 410 div 2 【解题报告】
- [Codeforces] Round #249 (Div. 2)解题报告(ABC)
- CUGBACM Codeforces Tranning 3 解题报告
- 【解题报告】Codeforces Round #363 (Div. 2)