NYOJ A Famous Music Composer

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
int main (void)
{
    int test_case = 0;
    char note[1000];
    while ( gets( note ) != NULL )
    {
        test_case ++;
        if ( note[0] == 'A' && note[1] == ' ' )
            printf( "Case %d: UNIQUE\n", test_case );
        else if ( note[0] == 'A' && note[1] == '#' )
        {
            note[0] = 'B';
            note[1] = 'b';
            printf( "Case %d: %s\n", test_case, note );
        }
        else if ( note[0] == 'B' && note[1] == 'b' )
        {
            note[0] = 'A';
            note[1] = '#';
            printf( "Case %d: %s\n", test_case, note );
        }
        else if ( note[0] == 'B' && note[1] == ' ' )
            printf( "Case %d: UNIQUE\n", test_case );
        else if ( note[0] == 'C' && note[1] == ' ' )
            printf( "Case %d: UNIQUE\n", test_case );
        else if ( note[0] == 'C' && note[1] == '#' )
        {
            note[0] = 'D';
            note[1] = 'b';
            printf( "Case %d: %s\n", test_case, note );
        }
        else if ( note[0] == 'D' && note[1] == 'b' )
        {
            note[0] = 'C';
            note[1] = '#';
            printf( "Case %d: %s\n", test_case, note );
        }
        else if ( note[0] == 'D' && note[1] == ' ' )
            printf( "Case %d: UNIQUE\n", test_case );
        else if ( note[0] == 'D' && note[1] == '#' )
        {
            note[0] = 'E';
            note[1] = 'b';
            printf( "Case %d: %s\n", test_case, note );
        }
        else if ( note[0] == 'E' && note[1] == 'b' )
        {
            note[0] = 'D';
            note[1] = '#';
            printf( "Case %d: %s\n", test_case, note );
        }
        else if ( note[0] == 'E' && note[1] == ' ' )
            printf( "Case %d: UNIQUE\n", test_case );
        else if ( note[0] == 'F' && note[1] == ' ' )
            printf( "Case %d: UNIQUE\n", test_case );
        else if ( note[0] == 'F' && note[1] == '#' )
        {
            note[0] = 'G';
            note[1] = 'b';
            printf( "Case %d: %s\n", test_case, note );
        }
        else if ( note[0] == 'G' && note[1] == 'b' )
        {
            note[0] = 'F';
            note[1] = '#';
            printf( "Case %d: %s\n", test_case, note );
        }
        else if ( note[0] == 'G' && note[1] == ' ' )
            printf( "Case %d: UNIQUE\n", test_case );
        else if ( note[0] == 'G' && note[1] == '#' )
        {
            note[0] = 'A';
            note[1] = 'b';
            printf( "Case %d: %s\n", test_case, note );
        }
        else if ( note[0] == 'A' && note[1] == 'b' )
        {
            note[0] = 'G';
            note[1] = '#';
            printf( "Case %d: %s\n", test_case, note );
        }
        else
            assert(false);
    }
    return EXIT_SUCCESS;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值