zoukankan      html  css  js  c++  java
  • 杭电1219--AC me

    AC Me

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


    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
     

     

    Recommend
    Ignatius.L   |   We have carefully selected several similar problems for you:  1222 1200 1201 1220 1235 
     
     1 #include <map>
     2 #include <stdio.h>
     3 #include <string.h>
     4 int num[30] ;
     5 using namespace std ;
     6 int main()
     7 {
     8     char str[100000] ;
     9     while(gets(str))
    10     {
    11         int j[100000], i ;
    12     //    map<string, int>j ;
    13         char c ;
    14         memset(j, 0, sizeof(j)) ;
    15         int len = strlen (str) ;
    16         for(c = 'a'; c<='z'; c++)
    17         {
    18             for(i=0; i<len; i++)
    19             {
    20                 if(str[i] == c)
    21                 {
    22                     j[c]++ ; 
    23                 }
    24             }
    25         }
    26         for(c = 'a'; c<='z'; c++)
    27         printf("%c:%d
    ",c, j[c]) ;    
    28         printf("
    ") ;
    29     }
    30     return 0 ;
    31 }

    //假期第一发 ;

  • 相关阅读:
    Git windows换行问题
    java之aop使用及自定义注解
    Shiro授权及注解式开发
    Git Gui、Ssh key的使用和ideaui配置使用Git解决冲突(下)
    Git和Github的介绍、简单操作、冲突(上)
    Shiro身份认证、盐加密
    Shiro简介、入门案例、web容器的集成
    SpringMVC入门
    Mybatis之关联关系(一对多、多对多)
    Mybatis整合(Redis、Ehcache)实现二级缓存
  • 原文地址:https://www.cnblogs.com/soTired/p/4660478.html
Copyright © 2011-2022 走看看