fork download
  1. #include "bits/stdc++.h"
  2. #define MAXN 100009
  3. #define INF 1000000007
  4. #define mp(x,y) make_pair(x,y)
  5. #define all(v) v.begin(),v.end()
  6. #define pb(x) push_back(x)
  7. #define wr cout<<"----------------"<<endl;
  8. #define ppb() pop_back()
  9. #define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
  10. #define ff first
  11. #define ss second
  12. #define my_little_dodge 46
  13. #define debug(x) cerr<< #x <<" = "<< x<<endl;
  14. using namespace std;
  15.  
  16. typedef long long ll;
  17. typedef pair<int,int> PII;
  18. template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
  19. template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
  20. int cnt[26];
  21. char s[MAXN];
  22. int main(){
  23. // freopen("input.txt", "r", stdin);
  24. //freopen("output.txt", "w", stdout);
  25. int t;
  26. scanf("%d",&t);
  27. assert(1<=t and t<=100);
  28. while(t--){
  29. memset(cnt,0,sizeof cnt);
  30. int n,sum=0;
  31. scanf("%d",&n);
  32. assert(1<=n and n<=100);
  33. for(int i=0;i<n;i++){
  34. scanf("%s",s);
  35. int sz=strlen(s);
  36. for(int j=0;j<sz;j++)
  37. cnt[s[j]-'a']++;
  38. sum+=sz;
  39. assert(1<=sz);
  40. }
  41. assert(1<=sum && sum<=1000);
  42. int ans=cnt['c'-'a']/2;
  43. umin(ans,cnt['o'-'a']);
  44. umin(ans,cnt['d'-'a']);
  45. umin(ans,cnt['e'-'a']/2);
  46. umin(ans,cnt['h'-'a']);
  47. umin(ans,cnt['f'-'a']);
  48. printf("%d\n",ans);
  49. }
  50. return 0;
  51. }
Runtime error #stdin #stdout #stderr 0s 15336KB
stdin
Standard input is empty
stdout
Standard output is empty
stderr
prog: prog.cpp:27: int main(): Assertion `1<=t and t<=100' failed.