【HDU 5980 Find Small A】+ 2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学)
2016-11-12 17:09
477 查看
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代码:
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 5971 Wrestling Match】+ 2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学) + 二分图染色
- Wrestling Match 2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学)hdu 5971
- 2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学)(7/10)
- HDU 5974 A Simple Math Problem(2016ACM/ICPC亚洲区大连站-重现赛 D题)
- HDU 5950 Recursive sequence(2016ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学))
- hdu 5533 Dancing Stars on Me 【2015ACM/ICPC亚洲区长春站-重现赛(感谢东北师大)】
- HDU 5976 Detachment 【贪心】 (2016ACM/ICPC亚洲区大连站)
- hdu 5975 树状数组原理题(2016ACM/ICPC亚洲区大连站)
- hdu 5971 Wrestling Match 判断能否构成二分图 [Problem A]2016ACM/ICPC亚洲区大连站
- 2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学) HDU 5512 Pagodas
- HDU 5514 Frogs(容斥原理)——2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学)
- 2015ACM/ICPC亚洲区长春站-重现赛(感谢东北师大)HDU 5532 Almost Sorted Array
- HDU 5952 Counting Cliques(2016ACM/ICPC亚洲区沈阳站-重现赛)
- 2016ACM/ICPC亚洲区大连站-重现赛
- HDU 5512 Pagodas 2015ACM/ICPC亚洲区沈阳站-重现赛(感谢东北大学)
- HDU 5979 Convex【计算几何】 (2016ACM/ICPC亚洲区大连站)
- HDU 5979 Convex【计算几何】 (2016ACM/ICPC亚洲区大连站)
- HDU-5971 Wrestling Match (2016ACM/ICPC亚洲区大连站)
- HDU - 5113 Black And White 搜索+剪枝 ( 2014ACM/ICPC亚洲区北京站-重现赛(感谢北师和上交))
- HDU - 5119 Happy Matt Friends dp 滚动数组 异或和 (2014ACM/ICPC亚洲区北京站-重现赛(感谢北师和上交)