Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined)

23:35～2:35 1.12.2017 |实际 23:35~1:40

题意：妙蛙种子太神了

题解：妙蛙种子太神了

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N=1e5+5,INF=1e9;
int n,c[300],ans=INF;
char s[N],a[20]="Bulbasaur";
int main(int argc, const char * argv[]) {
    scanf("%s",s+1);
    n=strlen(s+1);
    for(int i=1;i<=n;i++) c[s[i]]++;
    int len=strlen(a);//printf("ln %d %c\n",len,a[0]);
    for(int i=0;i<len;i++)
        ans=min(ans,c[a[i]]);
    ans=min(ans,min(c['a']/2,c['u']/2));
    printf("%d",ans);
    return 0;
}

妙蛙种子太神了