zoukankan      html  css  js  c++  java
  • hdu1219 AC Me

    AC Me

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


    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
     
    Author
    Ignatius.L
     
    Source
     1 # include<stdio.h>
     2 # include<memory.h>
     3 # include<string.h>
     4 int ch[26];
     5 char str[100005];
     6 int main()
     7 {
     8     int i;
     9     while(gets(str))
    10     {
    11         char cc='a';
    12         memset(ch,0,sizeof(ch));
    13         for(i=0; str[i]!=''; i++)
    14             if(str[i]>='a' && str[i]<='z')
    15                 ch[str[i]-'a']++;//这是我比较赞赏的
    16         for(i=0; i<26; i++)
    17             printf("%c:%d
    ",cc++,ch[i]);
    18         printf("
    ");
    19     }
    20     return 0;
    21 }
    View Code
  • 相关阅读:
    使用Session防止表单重复提交
    Session
    使用Cookie进行会话管理
    Java邻接表表示加权有向图,附dijkstra最短路径算法
    web工程中URL地址的推荐写法
    Web工程中各类地址的写法
    HTTP中的重定向和请求转发的区别
    squid代理
    代理服务 squid 隐藏真实ip,也就是透明代理
    docker添加sshd 服务
  • 原文地址:https://www.cnblogs.com/sxmcACM/p/3427588.html
Copyright © 2011-2022 走看看