zoukankan      html  css  js  c++  java
  • 数数字 (Digit Counting,ACM/ICPC Dannang 2007 ,UVa1225)

    题目描述:算法竞赛入门经典习题3-3

     1 #include <stdio.h>
     2 #include <string.h>
     3 int main(int argc, char *argv[])
     4 {
     5     int num[10] ;
     6     memset(num,0,sizeof(int)*10) ;
     7     char s[10005];
     8     scanf("%s",s) ;
     9     int n = strlen(s) ;
    10     for(int i=0;i<n;i++)
    11         for(int j=0;j<10;j++){
    12             if(s[i]-'0'==j) num[j]++ ;
    13         } 
    14     for(int i=0;i<10;i++){
    15         printf("%d:%d
    ",i,num[i]);
    16     }
    17     return 0;
    18 }
  • 相关阅读:
    aarch64_p1
    aarch64_o2
    aarch64_o1
    aarch64_n3
    aarch64_n2
    aarch64_n1
    aarch64_m3
    aarch64_m2
    aarch64_m1
    aarch64_l3
  • 原文地址:https://www.cnblogs.com/secoding/p/9484749.html
Copyright © 2011-2022 走看看