hdu1219
来源:互联网 发布:python 书籍推荐 编辑:程序博客网 时间:2024/06/03 10:35
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
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;}
0 0
- hdu1219
- hdu1219
- hdu1219
- HDU1219--AC Me
- hdu1219 AC Me
- HDU1219-AC Me
- HDU1219 AC Me【输入输出】
- hdu1219 AC Me
- hdu1219-map的简单运用
- hdu ACM steps 1.2.8 hdu1219
- Linux命令——w
- 开发iOS应用要比开发安卓应用省时约30%
- Leetcode138: Partition List
- Leetcode sql算法题
- 简单邻接表构造图
- hdu1219
- NSNotificationCenter观察者模式
- QQ space
- mysql命令操作
- leetcode-Same Tree
- atomic 加锁操作
- XMPP 及时通信二
- POJ Unimodal Palindromic Decompositions(DP)
- 表的两种连接方式