Codeforces Testing Round #8 B. Sheldon and Ice Pieces 水题

题目链接：http://codeforces.com/problemset/problem/328/B

水题~

 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 char n[], a[];
 int  b[], c[];
 int main(void) {
     //freopen("in.txt", "r", stdin);
     scanf("%s%s", n, a);
     int len1 = strlen(n), len2 = strlen(a);
     memset(b, , sizeof(b)); memset(c, , sizeof(c));
     for (int i = ; i < len1; ++i) b[n[i]-'']++;
     for (int i = ; i < len2; ++i) c[a[i]-'']++;
     b[]+=b[], b[]=, c[]+=c[], c[]=, b[]+=b[], b[]=, c[]+=c[], c[]=;
     int cnt=, Max=;
     for (int i = ; i < ; ++i){
         if (b[i]){
 cnt = c[i]/b[i]; if (cnt < Max) Max = cnt;
         }
     }
     printf("%d\n", Max);
     return ;
 }

=_=