hdu 5773 字符串水题

统计字符串出现次数

点击打开链接

#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
const int M=110; 
struct Node{
	char s[M];
	int win;
}node[40];

void pre()
{ 
	int i=0;
	
	node[i].win=1;
	strcpy(node[i++].s,"Cleveland Cavaliers");	
	
	
	node[i].win=2;
	strcpy(node[i++].s,"Golden State Warriors");
	
	
	
	node[i].win=5;
	strcpy(node[i++].s,"San Antonio Spurs");
	
	
	node[i].win=3;
	strcpy(node[i++].s,"Miami Heat");
	
	
	node[i].win=1;
	strcpy(node[i++].s,"Dallas Mavericks");
	
	node[i].win=11;
	strcpy(node[i++].s,"L.A. Lakers");
	
	
	
	node[i].win=17;
	strcpy(node[i++].s,"Boston Celtics");
	
	
	node[i].win=3;
	strcpy(node[i++].s,"Detroit Pistons");
	
	
	node[i].win=6;
	strcpy(node[i++].s,"Chicago Bulls");
	
	
	
	node[i].win=2;
	strcpy(node[i++].s,"Houston Rockets");
	
	
	node[i].win=2;	
	strcpy(node[i++].s,"Philadelphia 76ers");
	
	
	
	
	
	node[i].win=1;	
	strcpy(node[i++].s,"Seattle Sonics");
	
	
	node[i].win=1;	
	strcpy(node[i++].s,"Washington Bullets");
	
	
	
	node[i].win=1;	
	strcpy(node[i++].s,"Portland Trail Blazers");
	
	
	node[i].win=2;
	strcpy(node[i++].s,"New York Knicks");
	
	node[i].win=1;
	strcpy(node[i++].s,"Milwaukee Bucks");
	
	
	
	
	node[i].win=1;
	strcpy(node[i++].s,"St. Louis Hawks");
	
	node[i].win=1;
	strcpy(node[i++].s,"Baltimore Bullets");

	
	node[i].win=1;
	strcpy(node[i++].s,"Syracuse Nats");
	
	
	node[i].win=1;
	strcpy(node[i++].s,"Rochester Royals");
	
	node[i].win=5;
	strcpy(node[i++].s,"Minneapolis Lakers");
		
	
	node[i].win=2;
	strcpy(node[i++].s,"Philadelphia Warriors");

	
} 
int main()
{
	
	
	
	pre();
	int t;
	cin>>t;
	int cas=0;
	while(t--)
	{
		
		int flag=0;
		char q[M];
		if(!cas) 
		getchar();
		gets(q);
		
		printf("Case #%d: ",++cas);
		for(int i=0;i<40;i++)
		{
			if(strcmp(q,node[i].s)==0)
			{
				flag=1;
				cout<<node[i].win<<endl;	
			} 
			
		}
		if(!flag)
		{
		cout<<0<<endl;	
		}	
	} 
	
	return 0;
}