A Famous Music Composer
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 691 Accepted Submission(s): 408
Problem Description
Mr. B is a famous music composer. One of his most famous work was his set of preludes. These 24 pieces span the 24 musical keys (there are musically distinct 12 scale notes, and each may use major or minor tonality). The 12 distinct scale notes are:
Five of the notes have two alternate names, as is indicated above with equals sign. Thus, there are 17 possible names of scale notes, but only 12 musically distinct notes. When using one of these as the keynote for a musical key, we can further distinguish between major and minor tonalities. This gives 34 possible keys, of which 24 are musically distinct.
In naming his preludes, Mr. B used all the keys except the following 10, which were named instead by their alternate names:
Write a program that, given the name of a key, give an alternate name if it has one, or report the key name is unique.
![](https://i-blog.csdnimg.cn/blog_migrate/391c9d32a716958f9e8ef079e540b6ca.jpeg)
Five of the notes have two alternate names, as is indicated above with equals sign. Thus, there are 17 possible names of scale notes, but only 12 musically distinct notes. When using one of these as the keynote for a musical key, we can further distinguish between major and minor tonalities. This gives 34 possible keys, of which 24 are musically distinct.
In naming his preludes, Mr. B used all the keys except the following 10, which were named instead by their alternate names:
![](https://i-blog.csdnimg.cn/blog_migrate/bda406b9f7df9329e1cb70f322f65773.jpeg)
Write a program that, given the name of a key, give an alternate name if it has one, or report the key name is unique.
Input
Each test case is described by one line having the format "note tonality", where "note" is one of the 17 names for the scale notes given above, and "tonality" is either "major" or "minor" (quotes for clarify).
Output
For each case output the required answer, following the format of the sample.
Sample Input
Ab minor D# major G minor
Sample Output
Case 1: G# minor Case 2: Eb major Case 3: UNIQUE
Source
本题要求字符串的转换。这是个较为简单的题,用map容器直接就过了。
#include<iostream>
#include<string>
#include<cstdio>
#include<map>
using namespace std;
map<string,string>dic;
int main()
{
int tag=1;
string note,tonality;
dic["A"]="A";
dic["A#"]="Bb"; dic["Bb"]="A#";
dic["B"]="B";
dic["C"]="C";
dic["C#"]="Db"; dic["Db"]="C#";
dic["D"]="D";
dic["D#"]="Eb"; dic["Eb"]="D#";
dic["E"]="E";
dic["F"]="F";
dic["F#"]="Gb"; dic["Gb"]="F#";
dic["G"]="G";
dic["G#"]="Ab"; dic["Ab"]="G#";
while(cin>>note>>tonality)
{
printf("Case %d: ",tag++);
if(dic[note]!=note)
cout<<dic[note]<<" "<<tonality<<endl;
else printf("UNIQUE\n");
}
return 0;
}