钢琴改进版

userId_undefined
李祈佑
倔强青铜时间刺客ASCII炼金师循环·循环打卡人分支·分支解题者

2026-09-29 20:39:58

发布于：浙江

4阅读
0回复
0点赞

这是新的钢琴代码

#include<bits/stdc++.h>
#include<Windows.h>
using namespace std;
const double JB=pow(2.0,1.0/12.0);
string s;
int main(){
	while(true){
		cout<<"输入c停止，输入/停顿"<<endl;
		cout<<"先u升音阶，d降音阶"<<endl;
		cout<<"再可以升降调#，b"<<endl; 
		cin>>s;
		for(int i=0;i<s.size();i++){
			switch(s[i]){
				case '1':
				if(((s[i+1]=='u')||(s[i+1]=='d'))||((s[i+2]=='#')||(s[i+2]=='b'))){
					
					if(s[i+1]=='u'){
						if(s[i+2]=='#'){
							Beep(523*(JB*2)*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(523*(JB*2)/JB,200);
							Sleep(500);
						}else{
							Beep(523*(JB*2),200);
							Sleep(500);
						}
					}else if(s[i+1]=='d'){
						if(s[i+2]=='#'){
							Beep(523*(JB/2)*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(523*(JB/2)/JB,200);
							Sleep(500);
						}
						else{
							Beep(523/(JB*2),200);
							Sleep(500);
						}
					}
					
				}else{
					if(s[i+2]=='#'){
							Beep(523*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(523/JB,200);
							Sleep(500);
						}
					else{
						Beep(523,200);
						Sleep(500);
					}
				}
					break;
				///////////////////
				case '2':
				if(((s[i+1]=='u')||(s[i+1]=='d'))||((s[i+2]=='#')||(s[i+2]=='b'))){
					
					if(s[i+1]=='u'){
						if(s[i+2]=='#'){
							Beep(578*(JB*2)*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(578*(JB*2)/JB,200);
							Sleep(500);
						}else{
							Beep(578*(JB*2),200);
							Sleep(500);
						}
					}else if(s[i+1]=='d'){
						if(s[i+2]=='#'){
							Beep(578*(JB/2)*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(578*(JB/2)/JB,200);
							Sleep(500);
						}
						else{
							Beep(578/(JB*2),200);
							Sleep(500);
						}
					}
					
				}else{
					if(s[i+2]=='#'){
							Beep(578*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(578/JB,200);
							Sleep(500);
						}
					else{
						Beep(578,200);
						Sleep(500);
					}
				}
					break;
				///////////////////
					
				case '3':
				if(((s[i+1]=='u')||(s[i+1]=='d'))||((s[i+2]=='#')||(s[i+2]=='b'))){
					
					if(s[i+1]=='u'){
						if(s[i+2]=='#'){
							Beep(659*(JB*2)*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(659*(JB*2)/JB,200);
							Sleep(500);
						}else{
							Beep(659*(JB*2),200);
							Sleep(500);
						}
					}else if(s[i+1]=='d'){
						if(s[i+2]=='#'){
							Beep(659*(JB/2)*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(659*(JB/2)/JB,200);
							Sleep(500);
						}
						else{
							Beep(659/(JB*2),200);
							Sleep(500);
						}
					}
					
				}else{
					if(s[i+2]=='#'){
							Beep(659*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(659/JB,200);
							Sleep(500);
						}
					else{
						Beep(659,200);
						Sleep(500);
					}
				}
					break;
				///////////////////
				case '4':
				if(((s[i+1]=='u')||(s[i+1]=='d'))||((s[i+2]=='#')||(s[i+2]=='b'))){
					
					if(s[i+1]=='u'){
						if(s[i+2]=='#'){
							Beep(698*(JB*2)*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(698*(JB*2)/JB,200);
							Sleep(500);
						}else{
							Beep(698*(JB*2),200);
							Sleep(500);
						}
					}else if(s[i+1]=='d'){
						if(s[i+2]=='#'){
							Beep(698*(JB/2)*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(698*(JB/2)/JB,200);
							Sleep(500);
						}
						else{
							Beep(698/(JB*2),200);
							Sleep(500);
						}
					}
					
				}else{
					if(s[i+2]=='#'){
							Beep(698*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(698/JB,200);
							Sleep(500);
						}
					else{
						Beep(698,200);
						Sleep(500);
					}
				}
					break;
				///////////////////

				case '5':
				if(((s[i+1]=='u')||(s[i+1]=='d'))||((s[i+2]=='#')||(s[i+2]=='b'))){
					
					if(s[i+1]=='u'){
						if(s[i+2]=='#'){
							Beep(784*(JB*2)*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(784*(JB*2)/JB,200);
							Sleep(500);
						}else{
							Beep(784*(JB*2),200);
							Sleep(500);
						}
					}else if(s[i+1]=='d'){
						if(s[i+2]=='#'){
							Beep(784*(JB/2)*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(784*(JB/2)/JB,200);
							Sleep(500);
						}
						else{
							Beep(784/(JB*2),200);
							Sleep(500);
						}
					}
					
				}else{
					if(s[i+2]=='#'){
							Beep(784*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(784/JB,200);
							Sleep(500);
						}
					else{
						Beep(784,200);
						Sleep(500);
					}
				}
					break;
				///////////////////

				case '6':
				if(((s[i+1]=='u')||(s[i+1]=='d'))||((s[i+2]=='#')||(s[i+2]=='b'))){
					
					if(s[i+1]=='u'){
						if(s[i+2]=='#'){
							Beep(880*(JB*2)*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(880*(JB*2)/JB,200);
							Sleep(500);
						}else{
							Beep(880*(JB*2),200);
							Sleep(500);
						}
					}else if(s[i+1]=='d'){
						if(s[i+2]=='#'){
							Beep(880*(JB/2)*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(880*(JB/2)/JB,200);
							Sleep(500);
						}
						else{
							Beep(880/(JB*2),200);
							Sleep(500);
						}
					}
					
				}else{
					if(s[i+2]=='#'){
							Beep(880*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(880/JB,200);
							Sleep(500);
						}
					else{
						Beep(880,200);
						Sleep(500);
					}
				}
					break;
				///////////////////

				case '7':
				if(((s[i+1]=='u')||(s[i+1]=='d'))||((s[i+2]=='#')||(s[i+2]=='b'))){
					
					if(s[i+1]=='u'){
						if(s[i+2]=='#'){
							Beep(988*(JB*2)*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(988*(JB*2)/JB,200);
							Sleep(500);
						}else{
							Beep(988*(JB*2),200);
							Sleep(500);
						}
					}else if(s[i+1]=='d'){
						if(s[i+2]=='#'){
							Beep(988*(JB/2)*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(988*(JB/2)/JB,200);
							Sleep(500);
						}
						else{
							Beep(988/(JB*2),200);
							Sleep(500);
						}
					}
					
				}else{
					if(s[i+2]=='#'){
							Beep(988*JB,200);
							Sleep(500);
						}else if(s[i+2]=='b'){
							Beep(988/JB,200);
							Sleep(500);
						}
					else{
						Beep(988,200);
						Sleep(500);
					}
				}
					break;
				///////////////////

			}
		}
		Sleep(500);
		system("cls");
	}
	
	return 0;
}

改得我头晕眼花，好像还不太好

userId_undefined
去预览
0/2000
暂无数据

这里空空如也

热门讨论