可以发现,
12
12
12 个音阶为一个周期,我们以 WBWBWWBWBWBW
中的每一个音阶为开头,列举出所有的音阶顺序,再与输入的字符串的前
12
12
12 位进行对比,符合哪一个就输出对应开头的音。
参考代码如下 :
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
string str;
int main()
{
cin >> str;
str = str.substr(0, 12);//截取输入的字符串的前 12 位
printf( str == "WBWBWWBWBWBW" ? "Do\n" : ( str == "BWBWWBWBWBWW" ? "#Do\n" : ( str == "WBWWBWBWBWWB" ? "Re\n" : ( str == "BWWBWBWBWWBW" ? "#Re\n" : ( str == "WWBWBWBWWBWB" ? "Mi\n" : ( str == "WBWBWBWWBWBW" ? "Fa\n" : ( str == "BWBWBWWBWBWW" ? "#Fa\n" : ( str == "WBWBWWBWBWWB" ? "So\n" : ( str == "BWBWWBWBWWBW" ? "#So\n" : ( str == "WBWWBWBWWBWB" ? "La\n" : ( str == "BWWBWBWWBWBW" ? "#La\n" : "Si\n" ) ) ) ) ) ) ) ) ) ) );//把字符串与所有的音阶顺序进行对比
return 0;
}