Submission #1372606
Source Code Expand
#include<bits/stdc++.h> using namespace std; const long long INF = 1e7+1; const long long MOD = 1000000007; const long double PI = 3.1415926; #define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++) #define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--) #define REP(i,n) FOR(i,0,n) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define RALL(x) x.rbegin(),x.rend() typedef long long int ll; typedef vector<ll> vi; typedef vector < pair<ll, ll > > vp; typedef vector <string> vs; typedef vector <char> vc; typedef list <ll> lst; ll n,m, k, ans = 0, sum = 0, cnt = 0; string s; char c; /*--------------------template--------------------*/ int main() { cin >> s; string a = "WBWBWWBWBWBWWBWBWWBWBWBWWBWBWWBWBWBWWBWBWWBWBWBW"; int p = a.find(s); string ans; if (p == 0) ans = "Do"; if (p == 2) ans = "Re"; if (p == 4) ans = "Mi"; if (p == 5) ans = "Fa"; if (p == 7) ans = "So"; if (p == 9) ans = "La"; if (p == 11) ans = "Si"; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - ピアニスト高橋君 |
User | tettchan |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1022 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example_0.txt |
All | example_0.txt, handmade_0.txt, handmade_1.txt, handmade_2.txt, handmade_3.txt, handmade_4.txt, handmade_5.txt, handmade_6.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example_0.txt | AC | 1 ms | 256 KB |
handmade_0.txt | AC | 1 ms | 256 KB |
handmade_1.txt | AC | 1 ms | 256 KB |
handmade_2.txt | AC | 1 ms | 256 KB |
handmade_3.txt | AC | 1 ms | 256 KB |
handmade_4.txt | AC | 1 ms | 256 KB |
handmade_5.txt | AC | 1 ms | 256 KB |
handmade_6.txt | AC | 1 ms | 256 KB |