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 }

    //假期第一发 ;

  • 相关阅读:
    自制flash3D变换类
    Alchemy的使用和多项式批量计算的优化
    Bresenham直线扫描算法
    模拟流体粒子运动
    任意多边形的碰撞检测——向量积判断方法
    漂亮的雪花飘落和堆积效果
    发个简单怡情的粒子随机运动
    三次贝塞尔曲线绘制算法(优化过)
    失败是成功之母
    typeid操作符
  • 原文地址:https://www.cnblogs.com/soTired/p/4660478.html
Copyright © 2011-2022 走看看