Submission #8396477


Source Code Expand

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;


int main(int argc, char const* argv[])
{
  string s; cin >> s;
  if(s[2] == 'B')cout << "Bachelor";
  else if(s[2] == 'M')cout << "Master";
  else if(s[2] == 'D')cout << "Doctor";
  cout << " " << s[0] << s[1] << endl;
  return 0;
}

Submission Info

Submission Time
Task A - ぼくの学生証
User fumiphys
Language C++14 (GCC 5.4.1)
Score 50
Code Size 3160 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 50 / 50
Status AC
AC × 31
Set Name Test Cases
Sample
All 00_sample_00, 10_random_small_00, 10_random_small_01, 10_random_small_02, 10_random_small_03, 10_random_small_04, 10_random_small_05, 10_random_small_06, 10_random_small_07, 10_random_small_08, 10_random_small_09, 10_random_small_10, 10_random_small_11, 10_random_small_12, 10_random_small_13, 10_random_small_14, 10_random_small_15, 10_random_small_16, 10_random_small_17, 10_random_small_18, 10_random_small_19, 10_random_small_20, 10_random_small_21, 10_random_small_22, 10_random_small_23, 10_random_small_24, 10_random_small_25, 10_random_small_26, 10_random_small_27, 10_random_small_28, 10_random_small_29
Case Name Status Exec Time Memory
00_sample_00 AC 1 ms 256 KB
10_random_small_00 AC 1 ms 256 KB
10_random_small_01 AC 1 ms 256 KB
10_random_small_02 AC 1 ms 256 KB
10_random_small_03 AC 1 ms 256 KB
10_random_small_04 AC 1 ms 256 KB
10_random_small_05 AC 1 ms 256 KB
10_random_small_06 AC 1 ms 256 KB
10_random_small_07 AC 1 ms 256 KB
10_random_small_08 AC 1 ms 256 KB
10_random_small_09 AC 1 ms 256 KB
10_random_small_10 AC 1 ms 256 KB
10_random_small_11 AC 1 ms 256 KB
10_random_small_12 AC 1 ms 256 KB
10_random_small_13 AC 1 ms 256 KB
10_random_small_14 AC 1 ms 256 KB
10_random_small_15 AC 1 ms 256 KB
10_random_small_16 AC 1 ms 256 KB
10_random_small_17 AC 1 ms 256 KB
10_random_small_18 AC 1 ms 256 KB
10_random_small_19 AC 1 ms 256 KB
10_random_small_20 AC 1 ms 256 KB
10_random_small_21 AC 1 ms 256 KB
10_random_small_22 AC 1 ms 256 KB
10_random_small_23 AC 1 ms 256 KB
10_random_small_24 AC 1 ms 256 KB
10_random_small_25 AC 1 ms 256 KB
10_random_small_26 AC 1 ms 256 KB
10_random_small_27 AC 1 ms 256 KB
10_random_small_28 AC 1 ms 256 KB
10_random_small_29 AC 1 ms 256 KB