169人阅读 评论(0)

A Famous Music Composer

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1126    Accepted Submission(s): 633

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.

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

#include<stdio.h>
#include<string.h>
struct str{
char s1[3],s2[3];
}a[6];
int main()
{
int i,j,k;
char b1[3],b2[10];
strcpy(a[0].s1,"A#"),strcpy(a[0].s2,"Bb");
strcpy(a[1].s1,"C#");strcpy(a[1].s2,"Db");
strcpy(a[2].s1,"D#");strcpy(a[2].s2,"Eb");
strcpy(a[3].s1,"F#");strcpy(a[3].s2,"Gb");
strcpy(a[4].s1,"G#");strcpy(a[4].s2,"Ab");
k=1;
while(scanf("%s%s",b1,b2)!=EOF)
{
printf("Case %d: ",k++);
int len=strlen(b1);
if(len==1)
printf("UNIQUE\n");
else
{
for(i=0;i<5;i++)
{
if(strcmp(b1,a[i].s1)==0)
{
printf("%s %s\n",a[i].s2,b2);
break;
}
else if(strcmp(b1,a[i].s2)==0)
{
printf("%s %s\n",a[i].s1,b2);
break;
}
}
}
}
return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：37485次
• 积分：2233
• 等级：
• 排名：第16899名
• 原创：194篇
• 转载：7篇
• 译文：0篇
• 评论：2条