Codeforces Round #230 (Div. 2) A. Nineteen

题目连接：http://codeforces.com/problemset/problem/393/A

#include <iostream>#include <set>using namespace std;#include <cstdio>#include <cstring>#include <algorithm>char stu[200];int main(){    int i;    while(~scanf("%s",stu))    {        int len=strlen(stu);        multiset<char> s;        for(i=0;i<len;++i)        {            s.insert(stu[i]);        }        int nn=s.count('n');        int ii=s.count('i');        int ee=s.count('e');        int tt=s.count('t');        // printf("%d   %d   %d   %d\n",nn,ii,ee,tt);        int ans=0;        int flag=0;        if(nn>=3&&ii>=1&&ee>=3&&tt>=1)        {            nn-=3,ii-=1,ee-=3,tt-=1;flag=1;++ans;        }        for(;flag==1&&nn>=2&&ii>=1&&ee>=3&&tt>=1;nn-=2,ii-=1,ee-=3,tt-=1)        {            flag=1;            ++ans;        }               printf("%d\n",ans);        s.clear();    }    return 0;}