zoukankan      html  css  js  c++  java
  • AC Me

    AC Me

    Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)
    Total Submission(s) : 63   Accepted Submission(s) : 19
    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 <stdlib.h>
     3 #include <string.h>
     4 
     5 int main()
     6 {
     7     char a[100000];
     8     int i,b[26],k,j;
     9     while(gets(a))
    10     {
    11         int b[26]={0};
    12         j=strlen(a);
    13         for(i=0;i<j;i++)
    14         {
    15             k=a[i]-'a';
    16             b[k]++;
    17         }
    18         printf("a:%d
    b:%d
    c:%d
    d:%d
    e:%d
    f:%d
    g:%d
    h:%d
    i:%d
    j:%d
    k:%d
    l:%d
    m:%d
    n:%d
    o:%d
    p:%d
    q:%d
    r:%d
    s:%d
    t:%d
    u:%d
    v:%d
    w:%d
    x:%d
    y:%d
    z:%d
    
    ",b[0],b[1],b[2],b[3],b[4],b[5],b[6],b[7],b[8],b[9],b[10],b[11],b[12],b[13],b[14],b[15],b[16],b[17],b[18],b[19],b[20],b[21],b[22],b[23],b[24],b[25]);
    19     }
    20     return 0;
    21 }
    View Code
    转载请备注:
    **************************************
    * 作者: Wurq
    * 博客: https://www.cnblogs.com/Wurq/
    * Gitee: https://gitee.com/wurq
    **************************************
  • 相关阅读:
    动态规划例题
    c++ 进制转换函数
    约瑟夫问题
    set的基本使用
    stl中的二分查找
    1.生成的接口返回参数不包括系统自带的参数
    查看被锁定的表,并解锁
    添加、修改表中的字段
    NPOI简单示例2—合并表头
    NPOI简单示例
  • 原文地址:https://www.cnblogs.com/Wurq/p/3750242.html
Copyright © 2011-2022 走看看