C :

#include<stdio.h>
#include<string.h>
char ch[8]={'l','e','a','g','u','e','o','f'};
int count[7];
char  a[105];
int main()
{      int d;
       while(scanf("%s",a)!=EOF)
       {   d=1000;
           memset(count,0,sizeof(count));
           for(int i=0;i<strlen(a);i++)
           {
               if(a[i]=='l') count[0]++;
               else if(a[i]=='e')  count[1]++;
           else if(a[i]=='a')  count[2]++;
           else if(a[i]=='g')  count[3]++;
           else if(a[i]=='u')  count[4]++;

           else if(a[i]=='o')  count[5]++;
           else if(a[i]=='f')  count[6]++;


           }
           count[0]=count[0]/2;
           count[1]=count[1]/2;
           for(int i=0;i<7;i++)
           {
               if(count[i]<d)
                d=count[i];
           }
           printf("%d\n",d);
           memset(a,0,sizeof(a));

       }
       return 0;
}

C++ :

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char s[107];
int z[7];
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    while(scanf("%s",s)!=EOF)
    {
        int len=strlen(s),l=0,e=0,a=0,g=0,u=0,o=0,f=0;
        for(int i=0;i<len;i++)
        {
            if(s[i]=='l')l++;
            if(s[i]=='e')e++;
            if(s[i]=='a')a++;
            if(s[i]=='g')g++;
            if(s[i]=='u')u++;
            if(s[i]=='o')o++;
            if(s[i]=='f')f++;
        }
        l=(l-1);e=e/2;
        z[0]=l;z[1]=e;z[2]=a;z[3]=g;z[4]=u;z[5]=o;z[6]=f;
        sort(z,z+7);
        if(z[0]==-1)printf("0\n");
        else printf("%d\n",z[0]);
    }
    return 0;
}
//leagueofl