hdu 1219 hash
2017-09-06 08:00
267 查看
Problem Description
Ignatius is doing his homework now. The teacher gives him some articles and asks him to tell how many times each letter appears.
It’s really easy, isn’t it? So come on and AC ME.
Input
Each article consists of just one line, and all the letters are in lowercase. You just have to count the number of each letter, so do not pay attention to other characters. The length of article is at most 100000. Process to the end of file.
Note: the problem has multi-cases, and you may use “while(gets(buf)){…}” to process to the end of file.
Output
For each article, you have to tell how many times each letter appears. The output format is like “X:N”.
Output a blank line after each test case. More details in sample output.
Sample Input
hello, this is my first acm contest!
work hard for hdu acm.
Sample Output
a:1
b:0
c:2
d:0
e:2
f:1
g:0
h:2
i:3
j:0
k:0
l:2
m:2
n:1
o:2
p:0
q:0
r:1
s:4
t:4
u:0
v:0
w:0
x:0
y:1
z:0
a:2
b:0
c:1
d:2
e:0
f:1
g:0
h:2
i:0
j:0
k:1
l:0
m:1
n:0
o:2
p:0
q:0
r:3
s:0
t:0
u:1
v:0
w:1
x:0
y:0
z:0
Ignatius is doing his homework now. The teacher gives him some articles and asks him to tell how many times each letter appears.
It’s really easy, isn’t it? So come on and AC ME.
Input
Each article consists of just one line, and all the letters are in lowercase. You just have to count the number of each letter, so do not pay attention to other characters. The length of article is at most 100000. Process to the end of file.
Note: the problem has multi-cases, and you may use “while(gets(buf)){…}” to process to the end of file.
Output
For each article, you have to tell how many times each letter appears. The output format is like “X:N”.
Output a blank line after each test case. More details in sample output.
Sample Input
hello, this is my first acm contest!
work hard for hdu acm.
Sample Output
a:1
b:0
c:2
d:0
e:2
f:1
g:0
h:2
i:3
j:0
k:0
l:2
m:2
n:1
o:2
p:0
q:0
r:1
s:4
t:4
u:0
v:0
w:0
x:0
y:1
z:0
a:2
b:0
c:1
d:2
e:0
f:1
g:0
h:2
i:0
j:0
k:1
l:0
m:1
n:0
o:2
p:0
q:0
r:3
s:0
t:0
u:1
v:0
w:1
x:0
y:0
z:0
题解:
哈希记录一下即可。一开始把计数数组设置成char wa了。粗心了。代码:
#include <bits/stdc++.h> using namespace std; const int maxn = 100000+100; char str[maxn]; int num[26]; int main() { while(gets(str)!=NULL) { memset(num,0,sizeof(num)); int len = strlen(str); for(int i=0;i<len;i++) { //cout<<str[i]<<" "; if(isalpha(str[i])) num[str[i]-'a']++; } for(int i=0;i<26;i++) { printf("%c:%d\n",i+'a',num[i]); } printf("\n"); } return 0; }
相关文章推荐
- hdu_1496_equations( 二分 or hash )
- HDU 5183 - Negative and Positive (NP)(Hash)
- HDU 2094 产生冠军 hash 水题
- [hdu 6046 hash] 矩阵Hash+鸽巢定理
- hdu 1067(hash+bfs)
- hdu 2523(SORT AGAIN) hash
- HDU 1496 Equations hash HDU上排名第一!
- hdu 4821 String 字符串hash
- HDU 1800 Flying to the Mars(贪心 MAP 字典树 HASH)
- HDU 1264(离散化线段树;hash暴力)
- hdu 5199 Gunner (hash || 排序+二分)
- HDU——2112HDU Today(SPFA+简单Hash或map+前向星)
- 【hdu - 1219 AC Me】
- hdu 4886 TIANKENG’s restaurant(2)(hash+暴力)
- 字典树,HDU 1251 hash前缀
- hdu 1496 整数hash
- HDU 1004 模拟题|STL题|Hash题
- hdu 2087 hash(板子
- hdu 5085 Counting problem (分块+二进制优化下hash链表)
- HDU 1219(2013.9.21周赛B题:统计字母)