Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 0    Accepted Submission(s): 0

Problem Description
As the premier men's professional basketball league in the world, the National Basketball Association (NBA) has witnessed many superstars, legendary teams and precious friendships.

Here is a list of every season’s champion from the league's inception in 1946 to 2015.

Season Champion
2015-16 Cleveland Cavaliers
2014-15 Golden State Warriors
2013-14 San Antonio Spurs
2012-13 Miami Heat
2011-12 Miami Heat
2010-11 Dallas Mavericks
2009-10 L.A. Lakers
2008-09 L.A. Lakers
2007-08 Boston Celtics
2006-07 San Antonio Spurs
2005-06 Miami Heat
2004-05 San Antonio Spurs
2003-04 Detroit Pistons
2002-03 San Antonio Spurs
2001-02 L.A. Lakers
2000-01 L.A. Lakers
1999-00 L.A. Lakers
1998-99 San Antonio Spurs
1997-98 Chicago Bulls
1996-97 Chicago Bulls
1995-96 Chicago Bulls
1994-95 Houston Rockets
1993-94 Houston Rockets
1992-93 Chicago Bulls
1991-92 Chicago Bulls
1990-91 Chicago Bulls
1989-90 Detroit Pistons
1988-89 Detroit Pistons
1987-88 L.A. Lakers
1986-87 L.A. Lakers
1985-86 Boston Celtics
1984-85 L.A. Lakers
1983-84 Boston Celtics
1982-83 Philadelphia 76ers
1981-82 L.A. Lakers
1980-81 Boston Celtics
1979-80 L.A. Lakers
1978-79 Seattle Sonics
1977-78 Washington Bullets
1976-77 Portland Trail Blazers
1975-76 Boston Celtics
1974-75 Golden State Warriors
1973-74 Boston Celtics
1972-73 New York Knicks
1971-72 L.A. Lakers
1970-71 Milwaukee Bucks
1969-70 New York Knicks
1968-69 Boston Celtics
1967-68 Boston Celtics
1966-67 Philadelphia 76ers
1965-66 Boston Celtics
1964-65 Boston Celtics
1963-64 Boston Celtics
1962-63 Boston Celtics
1961-62 Boston Celtics
1960-61 Boston Celtics
1959-60 Boston Celtics
1958-59 Boston Celtics
1957-58 St. Louis Hawks
1956-57 Boston Celtics
1955-56 Philadelphia Warriors
1954-55 Syracuse Nats
1953-54 Minneapolis Lakers
1952-53 Minneapolis Lakers
1951-52 Minneapolis Lakers
1950-51 Rochester Royals
1949-50 Minneapolis Lakers
1948-49 Minneapolis Lakers
1947-48 Baltimore Bullets
1946-47 Philadelphia Warriors

(quoted from http://www.nba.com/history/nba-season-recaps/)

Given the team name, it won’t be difficult for you to count how many times this team(with exactly the same name) has made amazing happen.

 
Input
The first line gives the number of test cases. Each case contains one string S representing the team to be queried.
T<=30.S consists of English letters, digits, punctuations and spaces. And 1<=length(S)<=30.
 
Output
For each test case, output one line containing "Case #x: y", where x is the test case number (starting from 1) and y is the times this team has won the championship according to the list above.
 
Sample Input
2
Cleveland Cavaliers
Oklahoma City Thunder
 
Sample Output
Case #1: 1
Case #2: 0

题意:

给定这些年以来得过总冠军的队伍名称,求给你的队伍共取得了多少次冠军。

map水一发啊,注意输入的格式。

附AC代码:

 #include<iostream>
#include<cstring>
#include<cmath>
#include<map>
using namespace std; int main(){
int n;
cin>>n;
map<string,int> m;
m["Cleveland Cavaliers"]+=;
m["Golden State Warriors"]+=;
m["San Antonio Spurs"]+=;
m["Miami Heat"]+=;
m["Miami Heat"]+=;
m["Dallas Mavericks"]+=;
m["L.A. Lakers"]+=;
m["L.A. Lakers"]+=;
m["Boston Celtics"]+=;
m["San Antonio Spurs"]+=;
m["Miami Heat"]+=;
m["San Antonio Spurs"]+=;
m["Detroit Pistons"]+=;
m["San Antonio Spurs"]+=;
m["L.A. Lakers"]+=;
m["L.A. Lakers"]+=;
m["L.A. Lakers"]+=;
m["San Antonio Spurs"]+=;
m["Chicago Bulls"]+=;
m["Chicago Bulls"]+=;
m["Chicago Bulls"]+=;
m["Houston Rockets"]+=;
m["Houston Rockets"]+=;
m["Chicago Bulls"]+=;
m["Chicago Bulls"]+=;
m["Chicago Bulls"]+=;
m["Detroit Pistons"]+=;
m["L.A. Lakers"]+=;
m["L.A. Lakers"]+=;
m["Boston Celtics"]+=;
m["L.A. Lakers"]+=;
m["Boston Celtics"]+=;
m["Philadelphia 76ers"]+=;
m["L.A. Lakers"]+=;
m["Boston Celtics"]+=;
m["L.A. Lakers"]+=;
m["Seattle Sonics"]+=;
m["Washington Bullets"]+=;
m["Portland Trail Blazers"]+=;
m["Boston Celtics"]+=;
m["Golden State Warriors"]+=;
m["Boston Celtics"]+=;
m["New York Knicks"]+=;
m["L.A. Lakers"]+=;
m["Milwaukee Bucks"]+=;
m["New York Knicks"]+=;
m["Boston Celtics"]+=;
m["Boston Celtics"]+=;
m["Philadelphia 76ers"]+=;
m["Boston Celtics"]+=;
m["St. Louis Hawks"]+=;
m["Boston Celtics"]+=;
m["Philadelphia Warriors"]+=;
m["Syracuse Nats"]+=;
m["Minneapolis Lakers"]+=;
m["Rochester Royals"]+=;
m["Minneapolis Lakers"]+=;
m["Minneapolis Lakers"]+=;
m["Baltimore Bullets"]+=;
m["Philadelphia Warriors"]+=; int k=;
getchar();//!
for(int i=;i<n;i++){char s[];
gets(s);//!读入空格
cout<<"Case #"<<k++<<": ";
cout<<m[s]<<endl;
}
return ;
}

string测了一发也可以:

 #include<iostream>
#include<cstring>
#include<cmath>
#include<map>
using namespace std; int main(){
int n;
cin>>n;
map<string,int> m;
m["Cleveland Cavaliers"]+=;
m["Golden State Warriors"]+=;
m["San Antonio Spurs"]+=;
m["Miami Heat"]+=;
m["Miami Heat"]+=;
m["Dallas Mavericks"]+=;
m["L.A. Lakers"]+=;
m["L.A. Lakers"]+=;
m["Boston Celtics"]+=;
m["San Antonio Spurs"]+=;
m["Miami Heat"]+=;
m["San Antonio Spurs"]+=;
m["Detroit Pistons"]+=;
m["San Antonio Spurs"]+=;
m["L.A. Lakers"]+=;
m["L.A. Lakers"]+=;
m["L.A. Lakers"]+=;
m["San Antonio Spurs"]+=;
m["Chicago Bulls"]+=;
m["Chicago Bulls"]+=;
m["Chicago Bulls"]+=;
m["Houston Rockets"]+=;
m["Houston Rockets"]+=;
m["Chicago Bulls"]+=;
m["Chicago Bulls"]+=;
m["Chicago Bulls"]+=;
m["Detroit Pistons"]+=;
m["L.A. Lakers"]+=;
m["L.A. Lakers"]+=;
m["Boston Celtics"]+=;
m["L.A. Lakers"]+=;
m["Boston Celtics"]+=;
m["Philadelphia 76ers"]+=;
m["L.A. Lakers"]+=;
m["Boston Celtics"]+=;
m["L.A. Lakers"]+=;
m["Seattle Sonics"]+=;
m["Washington Bullets"]+=;
m["Portland Trail Blazers"]+=;
m["Boston Celtics"]+=;
m["Golden State Warriors"]+=;
m["Boston Celtics"]+=;
m["New York Knicks"]+=;
m["L.A. Lakers"]+=;
m["Milwaukee Bucks"]+=;
m["New York Knicks"]+=;
m["Boston Celtics"]+=;
m["Boston Celtics"]+=;
m["Philadelphia 76ers"]+=;
m["Boston Celtics"]+=;
m["St. Louis Hawks"]+=;
m["Boston Celtics"]+=;
m["Philadelphia Warriors"]+=;
m["Syracuse Nats"]+=;
m["Minneapolis Lakers"]+=;
m["Rochester Royals"]+=;
m["Minneapolis Lakers"]+=;
m["Minneapolis Lakers"]+=;
m["Baltimore Bullets"]+=;
m["Philadelphia Warriors"]+=; int k=;
getchar();
for(int i=;i<n;i++){string s;
getline(cin,s);
cout<<"Case #"<<k++<<": ";
cout<<m[s]<<endl;
}
return ;
}

Where Amazing Happens的更多相关文章

  1. RxJS + Redux + React = Amazing!(译一)

    今天,我将Youtube上的<RxJS + Redux + React = Amazing!>翻译(+机译)了下来,以供国内的同学学习,英文听力好的同学可以直接看原版视频: https:/ ...

  2. RxJS + Redux + React = Amazing!(译二)

    今天,我将Youtube上的<RxJS + Redux + React = Amazing!>的后半部分翻译(+机译)了下来,以供国内的同学学习,英文听力好的同学可以直接看原版视频: ht ...

  3. The Amazing ProgressBar Control(转)

    好久没写博客了,今天就先转一篇,随后可以再写些~~~ 直接把原文粘过来,就不再进行翻译和个人说明了,因为效果很COOL~ The Amazing ProgressBar Control A progr ...

  4. 【jquery】一款不错的音频播放器——Amazing Audio Player

    前段时间分享了一款视频播放器,点击这里.今天介绍一款不错的音频播放器——Amazing Audio Player. 介绍: Amazing Audio Player 是一个使用很方便的 Windows ...

  5. hdu 5774 Where Amazing Happens

    Where Amazing Happens 题意: 让你输出各个队名的出现次数. 题解: 打表题,好坑,相同的没有放在一起,需要认真找,否则容易错. 代码: #include<iostream& ...

  6. Lesson 3: The Amazing New Mobile Web

    Lesson 3: The Amazing New Mobile Web Article 1: This is Responsive by Brad Frost 各种响应式网站设计的资源. Artic ...

  7. hdu 5774 Where Amazing Happens 水题

    Where Amazing Happens 题目连接: http://acm.hdu.edu.cn/showproblem.php?pid=5774 Description As the premie ...

  8. English trip V1 - 5.That's Amazing! 棒极了! Teacher:Patrick Key: can or can't

    In this lesson you will learn to describe what people can do. 在本课中,您将学习如何描述人们可以做什么. STARTE drive a c ...

  9. [翻译] The Amazing Audio Engine

    The Amazing Audio Engine https://github.com/TheAmazingAudioEngine/TheAmazingAudioEngine The Amazing ...

  10. 13 Amazing Component Sets Driving Success In Delphi Berlin On Android And IOS

    There are quite a few Firemonkey component sets available for Delphi Berlin which can get you ahead ...

随机推荐

  1. Tar压缩文件

    [root@test /root]# tar [-zxcvfpP] filename   [root@test /root]# tar -N 'yyyy/mm/dd' /path -zcvf targ ...

  2. 关于one-hot encoding思考

    Many learning algorithms either learn a single weight per feature, or they use distances between sam ...

  3. [转]Linux统计代码行数

    wc -l *.c *.h 就可以知道当前目录下的所有c 和 h 文件的行数的详细信息.很不错 如果要递归,可以配合其他命令一起使用 当前目录及子目录: find . -name *.c |xargs ...

  4. ZOJ ACM 1314(JAVA)

    昨天做了几个题目.过于简单,就不在博客里面写了. 1314这道题也比較简单,写出来是由于我认为在这里有一个小技巧,对于时间复杂度和空间复杂度都比較节省. 这个题目类似哈希表的求解.可是更简单.刚拿到题 ...

  5. Frame Relay - 简单介绍及基本配置

    Frame Relay如今越来越不流行了,只是在过去的设计中被广泛应用. 所以工作上还是能常常见到的, 这篇博文从二层简单总结下FR的一些概念 在介绍Frame Relay之前,先了解下广播介质和非广 ...

  6. SQL数据库 更改数据类型

    向表中添加数据 alter table 表名 add 列名 类型 更改表中列的数据类型 alter table 表名 alter column 列名 类型 删除表中的指定列 alter table 表 ...

  7. HDU 2955 Robberies(01背包变形)

    Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total S ...

  8. 创建一个zookeeper的会话(实现watcher)

    在先前的章节中,我们利用zkCli去了解了一下主要的zookeeper的操作.在接下来的章节中,我们将会学习一下在应用中是怎样利用zookeeper的api的.接下来我们将利用一个程序展示一下,怎样来 ...

  9. 进程-IPC 管道 (一)

    详见:https://github.com/ZhangzheBJUT/linux/blob/master/IPC(%E4%B8%80).md 一 IPC 概述 进程间通信就是在不同进程之间传播或交换信 ...

  10. HDU 6108 小C的倍数问题 【数学】 (2017"百度之星"程序设计大赛 - 初赛(A))

    小C的倍数问题 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Sub ...