Submission #2834496

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <numeric>
#include <climits>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int n, m;
string p, q, r;
int main(){
	cin >> n;
    for(int i=0; i<n; ++i){
        cin >> p >> q >> r;
        if(p=="MIDDLE") cout << r[r.size()/2];
        if(p=="BEGINNING") cout << r[0];
        if(p=="END") cout << r[r.size()-1];
    }
    cout << endl;
	return 0;
}

Submission Info

Judge Result