南阳oj 题目25 A Famous Music Composer

原创 2015年07月09日 08:05:04

A Famous Music Composer

时间限制:1000 ms  |  内存限制:65535 KB
难度:1
描述
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. 
输入
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).
输出
For each case output the required answer, following the format of the sample.
样例输入
Ab minor
D# major
G minor
样例输出
Case 1: G# minor
Case 2: Eb major
Case 3: UNIQUE

注:此题为:南阳oj 题目25 A Famous Music Composer


说明:数组不能太小,否则 WrongAnswer


已AC源代码:

#include<stdio.h>
#include<string.h>
int main()
{
	char ch1[20],ch2[20];
	int T=0;
	while(~scanf("%s %s",ch1,ch2))
	{
		T++;
		printf("Case %d: ",T);
		if(strcmp(ch1,"A#")==0) //A#=Bb
		    printf("Bb %s\n",ch2);
		else if(strcmp(ch1,"Bb")==0)
	    	printf("A# %s\n",ch2);
	    else if(strcmp(ch1,"C#")==0) //C#=Db
	    	printf("Db %s\n",ch2);
	    else if(strcmp(ch1,"Db")==0)
	    	printf("C# %s\n",ch2);
	    else if(strcmp(ch1,"D#")==0) //D#=Eb
	    	printf("Eb %s\n",ch2);
	    else if(strcmp(ch1,"Eb")==0)
	    	printf("D# %s\n",ch2);
	    else if(strcmp(ch1,"F#")==0) //F#=Gb
	    	printf("Gb %s\n",ch2);
	   	else if(strcmp(ch1,"Gb")==0)
	    	printf("F# %s\n",ch2);
	    else if(strcmp(ch1,"G#")==0)//G#=Ab
	    	printf("Ab %s\n",ch2);
	    else if(strcmp(ch1,"Ab")==0)
	    	printf("G# %s\n",ch2);
		else
		    printf("UNIQUE\n");
	}
	return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

A Famous Music Composer(南阳oj25)(一道无聊的英文题)

A Famous Music Composer 时间限制:1000 ms  |  内存限制:65535 KB 难度:1 描述 Mr. B is a famous music...

南阳题目25-A Famous Music Composer

A Famous Music Composer 时间限制:1000 ms  |  内存限制:65535 KB 难度:1 描述 Mr. B is a famous music...

HDU4245:A Famous Music Composer

Problem Description Mr. B is a famous music composer. One of his most famous work was his set of pr...

A Famous Music Composer

A Famous Music Composer 时间限制:1000 ms  |  内存限制:65535 KB 难度:1 描述 Mr. B is a famous music...

[4245]:A Famous Music Composer

Input Each test case is described by one line having the format “note tonality”, where “note” is on...

HDU4245 A Famous Music Composer

Problem Description Mr. B is a famous music composer. One of his most famous work was his set of pr...

NYOJ A Famous Music Composer

#include #include #include int main (void) { int test_case = 0; char note[1000]; whil...

hdu 42445A Famous Music Composer

A Famous Music Composer Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java...

南阳理工OJ_题目710 外星人的供给站

#include #include #include //贪心算法 //把点转换成区间 //去掉大区间 //贪心开始... usin...

南阳oj题目20吝啬的国度 菜鸟的进阶之路

吝啬的国度时间限制:1000 ms | 内存限制:65535 KB 难度:3描述 在一个吝啬的国度里有N个城市,这N个城市间只有N-1条路把这个N个城市连接起来。现在,Tom在第S号城市,...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:南阳oj 题目25 A Famous Music Composer
举报原因:
原因补充:

(最多只允许输入30个字)