POJ 2973 unordered string matches with wildcard characters

Test instructions

Two unordered strings are matched with wildcard characters.

Analysis:

The character frequency can be directly counted.

Code:

POJ 2973
//sepnine
#include <iostream>
#include <map>
#include <string>
using namespace std;
String dictionary[1024];
int num[32];
int tmp[32];
int main ()
{
	int i,j,n;
	while (Cin>>n&&n) {for
		(i=1;i<=n;++i)
			cin>>dictionary[i];
		string C;
		cin>>c;			
		int cnt=0,ans=0;
		memset (num,0,sizeof (num));
		For (I=0;i<c.length (); ++i)
			if (c[i]== ' _ ')
				++cnt;		
			else
				++num[c[i]-' A '];
		for (i=1;i<=n;++i) {
			memset (tmp,0,sizeof (TMP));
			For (J=0;j<dictionary[i].length (); ++j)
				++tmp[dictionary[i][j]-' A '];
			int sum=0;
			for (j=0;j<= ' Z '-' A '; ++j)
				if (Tmp[j]>num[j])
					sum+=tmp[j]-num[j];
			if (sum<=cnt)
				++ans;
		}
		printf ("%d\n", ans);
	}
	return 0;