题目描述
The Professor gives Xiao Zi some articles and asks him to account how many times each letter appears in a...z .
It's really easy, isn't it? So come on and Do it.
输入格式
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.
输出格式
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.
hello, this is my first acm contest!
work hard for zj acm.
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:1
e:0
f:1
g:0
h:1
i:0
j:1
k:1
l:0
m:1
n:0
o:2
p:0
q:0
r:3
s:0
t:0
u:0
v:0
w:1
x:0
y:0
z:1