Submission #1180433

---

Source Code Expand

#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
using namespace std;
typedef long long ll;
int main() {
	string a, s;
	a = "WBWBWWBWBWBW";
	string c[12] = { "Do","","Re","","Mi","Fa","","So","","La","","Si" };
	a += a;
	a += a;
	cin >> s;
	for (int i = 0; i < 12; i++) {
		if (a[i] == 'W') {
			string b = a.substr(i, 20);
			if (b == s) {
				cout << c[i] << endl;
				break;
			}
		}
	}
}

Submission Info

Judge Result