hdu1219
2015-11-04 20:22
295 查看
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
题的大概意思就是计算a-z出现的次数;
代码:
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
题的大概意思就是计算a-z出现的次数;
代码:
#include <iostream> #include <string> #include <cstring> #include <stdio.h> using namespace std; int main() { int a[27];char c; string st; while(getline(cin,st)){ memset(a,0,sizeof(a)); for(int i=0;i<st.size();i++) if(st[i]>='a'&&st[i]<='z') a[st[i]-97]++; for(int i=0;i<26;i++) { c=i+97; cout<<c<<":"<<a[i]<<endl; } cout<<endl; } return 0; }
相关文章推荐
- hdu1219
- 源生javascript将xml转换成json格式
- sde用sql实现erase
- 归并排序算法之Java实现
- Tomcat 8 解决“At least one JAR was scanned for TLDs yet contained no TLDs”问题
- sde用sql实现erase
- springmvc mybatis 整合 框架源码 bootstrap html5 mysql oracle spring
- C++primer第五版第三章学习笔记
- RecyclerView的下拉刷新和自动加载更多
- Android自定义相机超详细讲解
- hdu5521 Meeting
- AlertDialog中View中的控件设置监听
- java Map及Map.Entry详解
- 2015ACM/ICPC亚洲区长春站 F hdu 5533 Almost Sorted Array
- 不要把配置文件放到你的Git代码仓库
- C++Primer之复合类型
- 交换两个数组的内容
- linux之find命令详解
- linux 内核链表( 四 )
- LeetCode300——Longest Increasing Subsequence