【HDU 5980 Find Small A】+ 2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学)
来源:互联网 发布:上海网鱼网络大学城店 编辑:程序博客网 时间:2024/05/01 21:13
Find Small A
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 324 Accepted Submission(s): 162
Problem Description
As is known to all,the ASCII of character ‘a’ is 97. Now,find out how many character ‘a’ in a group of given numbers. Please note that the numbers here are given by 32 bits’ integers in the computer.That means,1digit represents 4 characters(one character is represented by 8 bits’ binary digits).
Input
The input contains a set of test data.The first number is one positive integer N (1≤N≤100),and then N positive integersai (1≤ ai≤2^32 - 1) follow
Output
Output one line,including an integer representing the number of ‘a’ in the group of given numbers.
Sample Input
3
97 24929 100
Sample Output
3
Source
2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学)
每个数的二进制位每 8 位 为一个字符,有多少个等于’a’的ASCII字符~
AC代码:
#include<bits/stdc++.h>int pa[33];int main(){ int n,a,nl,ans; while(scanf("%d",&n) != EOF){ ans = 0; while(n--){ memset(pa,0,sizeof(pa)); scanf("%d",&a); nl = 0; while(a){ pa[++nl] = a & 1; a >>= 1; } for(int i = 1 ; i <= nl; i += 8){ int sum = 0,p = 1; for(int j = i ; j <= i + 7 ; j++){ sum += p * pa[j]; p <<= 1; } if(sum == 97) ans++; } } printf("%d\n",ans); } return 0;}
- 【HDU 5980 Find Small A】+ 2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学)
- Wrestling Match 2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学)hdu 5971
- HDU 5974 A Simple Math Problem(数学解方程)——2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学)
- 【HDU 5971 Wrestling Match】+ 2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学) + 二分图染色
- HDU 5974 A Simple Math Problem(2016ACM/ICPC亚洲区大连站-重现赛 D题)
- HDU 5980 && 2016ICPC大连 J: Find Small A
- HDU 5950 Recursive sequence(2016ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学))
- 2016ICPC大连站 J Find Small A【water】
- 2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学) HDU 5512 Pagodas
- HDU 5512 Pagodas 2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学)
- HDU5971, 2016ACM/ICPC亚洲区大连站第一题
- 2016ACM/ICPC亚洲区大连站【solved:10 / 11】
- 2016ACM/ICPC亚洲区大连站 H
- 2016ACM/ICPC亚洲区大连站 I
- 2016ACM/ICPC亚洲区大连站 J
- 2016ACM/ICPC亚洲区大连站 D
- hdu 5971 Wrestling Match 判断能否构成二分图 [Problem A]2016ACM/ICPC亚洲区大连站
- HDU 5979 Convex【计算几何】 (2016ACM/ICPC亚洲区大连站)
- getline()函数详解
- Qt之模版类
- JAVA CAS原理深度分析
- 存储管理之动态分区分配(实验四)
- Qt系统对话框
- 【HDU 5980 Find Small A】+ 2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学)
- 获取模块句柄/基址
- 股神20年股票投资精髓:做不到快狠准,就要慢稳忍
- Android 7.0 分屏拖拽文字和图片的研究
- android中的ViewPager
- 1092. To Buy or Not to Buy (20)
- hjr教程-Android(一):环境搭建与第一个Activity
- Hashtable,HashMap,ConcurrentHashMap 底层实现原理与线程安全问题
- sudo spctl --master-disable