ACM!荣耀之路!

【已退役】

HDU4245:A Famous Music Composer

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
 


 

水题,只要按照第一个表有等于的输出转换的字符串,没有转换则输出UNIQUE即可

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

char str[100];
int cas = 1;

int main()
{
    while(gets(str))
    {
        printf("Case %d: ",cas++);
        int i,j,len;
        len = strlen(str);
        if(str[1] == ' ')
            printf("UNIQUE\n");
        else
        {
            if(str[1] == '#')
            {
                if(str[0] == 'G')
                    printf("Ab");
                else
                    printf("%cb",str[0]+1);
            }
            else if(str[1] == 'b')
            {
                if(str[0] == 'A')
                printf("G#");
                else
                printf("%c#",str[0]-1);
            }
            for(i = 2;i<len;i++)
            printf("%c",str[i]);
            printf("\n");
        }
    }

    return 0;
}


 

 

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/libin56842/article/details/17059613
文章标签: HDU
个人分类:
上一篇POJ1833:排列
下一篇HDU4247:A Famous ICPC Team
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭