zoukankan      html  css  js  c++  java
  • hdu 1219 AC Me

    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

    水题!!!

    AC代码:

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 char a[100005];
     4 int b[26],len;
     5 int main()
     6 {
     7     char ch='a';
     8     while(gets(a)){
     9         memset(b,0,sizeof(b));
    10         len=strlen(a);
    11         for(int i=0;i<len;i++)if(a[i]>='a'&&a[i]<='z')b[a[i]-'a']++;//遇到字母就保存到b数组里面
    12         for(int i=0;i<26;i++)
    13             printf("%c:%d
    ",ch+i,b[i]);
    14         cout<<endl;
    15     }
    16     return 0;
    17 }
     
    作者:霜雪千年
    本文版权归作者和博客园共有,欢迎转载,但未经作者同意必须在文章页面给出原文连接,否则保留追究法律责任的权利。
  • 相关阅读:
    定位服务器的性能
    关于tcp的keepalive
    写给future的话
    声音评测专用术语
    高效能人士必知铁律--note
    《如何高效学习》读书笔记
    如何快速接手一个系统?
    几个基础函数及特性
    最大的矩形(测试全对,为什么只有20分??)
    输入字符串(由0,1组成),编程计算其中连续0,1出现的最大次数
  • 原文地址:https://www.cnblogs.com/acgoto/p/8467221.html
Copyright © 2011-2022 走看看