HDU 5774 (Where Amazing Happens 简单计算)

题目链接
简单计算一下

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<cstdlib>
#include<vector>
using namespace std;
#define cl(a,b) memset(a,b,sizeof(a))
#define LL long long
#define pb push_back
#define gcd __gcd

#define For(i,j,k) for(int i=(j);i<k;i++)
#define lowbit(i) (i&(-i))
#define _(x) printf("%d\n",x)

const int maxn = 2e5+200;
const LL inf  = 1LL << 34;
const LL mod = 1000000007;


char s[maxn];

char A[][100]{
"Cleveland Cavaliers",
 "Golden State Warriors",
 "San Antonio Spurs",
 "Miami Heat",
 "Miami Heat",
 "Dallas Mavericks",
 "L.A. Lakers",
 "L.A. Lakers",
 "Boston Celtics",
 "San Antonio Spurs",
 "Miami Heat",
 "San Antonio Spurs",
 "Detroit Pistons",
 "San Antonio Spurs",
 "L.A. Lakers",
 "L.A. Lakers",
 "L.A. Lakers",
 "San Antonio Spurs",
 "Chicago Bulls",
 "Chicago Bulls",
 "Chicago Bulls",
 "Houston Rockets",
 "Houston Rockets",
 "Chicago Bulls",
 "Chicago Bulls",
 "Chicago Bulls",
 "Detroit Pistons",
 "Detroit Pistons",
 "L.A. Lakers",
 "L.A. Lakers",
 "Boston Celtics",
 "L.A. Lakers",
 "Boston Celtics",
 "Philadelphia 76ers",
 "L.A. Lakers",
 "Boston Celtics",
 "L.A. Lakers",
 "Seattle Sonics",
 "Washington Bullets",
 "Portland Trail Blazers",
 "Boston Celtics",
 "Golden State Warriors",
 "Boston Celtics",
 "New York Knicks",
 "L.A. Lakers",
 "Milwaukee Bucks",
 "New York Knicks",
 "Boston Celtics",
 "Boston Celtics",
 "Philadelphia 76ers",
 "Boston Celtics",
 "Boston Celtics",
 "Boston Celtics",
 "Boston Celtics",
 "Boston Celtics",
 "Boston Celtics",
 "Boston Celtics",
 "Boston Celtics",
 "St. Louis Hawks",
 "Boston Celtics",
 "Philadelphia Warriors",
 "Syracuse Nats",
 "Minneapolis Lakers",
 "Minneapolis Lakers",
 "Minneapolis Lakers",
 "Rochester Royals",
 "Minneapolis Lakers",
 "Minneapolis Lakers",
 "Baltimore Bullets",
 "Philadelphia Warriors"
};

int main(){
    int T;int cas=1;
    scanf("%d",&T);getchar();
    while(T--){
        gets(s);
        int ans = 0;
        for(int i=0;i<(2015-1946+1);i++){
            if(!strcmp(A[i],s))ans++;
        }
        printf("Case #%d: %d\n",cas++,ans);
    }
    return 0;
}