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

    AC Me

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 18543    Accepted Submission(s): 7836

    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

    #include<stdio.h>
    #include<string.h>char x[100001];
    int ans[26];
    int count=0;
    int main()
    {
     int len,i;
        while(gets(x))
        {
           memset(ans,0,sizeof(ans));
           len=strlen(x);
        for(i=0;i<len;i++)
             {
              if(x[i]>='a' && x[i]<='z')
                 ans[(int)x[i]-'a']++;
             }
        for(i=0;i<26;i++)
           printf("%c:%d
    ",i+'a',ans[i]);
        printf("
    ");     
        }
     return 0; 
    }
    

      

  • 相关阅读:
    【BZOJ1858】序列操作(SCOI2010)-线段树
    【BZOJ1858】序列操作(SCOI2010)-线段树
    【SPOJ3267】D-query-莫队算法
    【BZOJ2038】小Z的袜子(2009国家集训队)-莫队算法
    【BZOJ2038】小Z的袜子(2009国家集训队)-莫队算法
    【HDU3966】Aragorn's Story-树链剖分或LCT维护路径
    BZOJ 4569 萌萌哒
    BZOJ 2460 元素
    BZOJ 2115 Xor
    BZOJ 2750 Road
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7057947.html
Copyright © 2011-2022 走看看