暑期第一次比赛（没有打起足够的精神）

       今天是暑期集训的第一场比赛，大家都显得没能够打起十二分的精神，困得都快不行了，没有全身心地投入到比赛当中。比赛的题目应该以前杭电上的一场比赛。写两篇结题感受吧。

       

A - A Famous Music Composer

Time Limit:1000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit  Status  Practice  SPOJ MUSIC2

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:

A	A# = Bb	B	C	C# = Db	D
D# = Eb	E	F	F# = Gb	G	G# = Ab

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:

Ab minor	A# major	A# minor	C# major	Db minor
D# major	D# minor	Gb major	Gb minor	G# major

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. All notes names will be uppercase.

Output

For each case output the required answer, following the format of the sample.

Example

Input: Ab minor
D# major
G minor 

Output:

Case 1: G# minor
Case 2: Eb major
Case 3: UNIQUE

题目大意：这道题其实一开始都没有读懂题，还是我们的妇联同志给我讲明白的。意思就是按照表格中的等价关系，对相应的字符段进行替换。不过也有些技巧，E是D的下一个字母，G是F的下一个字母，类似的还有一下。
    
    
D# = Eb
 
 
F#
 = Gb
下面就是代码实现：

    
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include<math.h>
#include<cstdlib>
using namespace std;
#include<stdio.h>
#define N 3000+10
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;
}