Submission #1516552

---

Source Code Expand

#include <iostream>
#include <complex>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>
#include <functional>
#include <cstdlib>
#include <queue>
#include <tuple>
#include <map>
#include <cmath>

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define DFOR(i,a) for(int i=(a);i>=0;i--)
#define SORT(v, n) sort(v, v+n)

using namespace std;

const double EPS =1e-9;
const long INF =999999999;
const long MINF =-999999999;

string fn(string target,int a,int b){
	FOR(i,0,(b-a+1)/2) swap(target[a+i],target[b-i]);
	return target;
}

int main(){
	int N,a,b,i;
	string S,result;
	cin>>S>>N;
	FOR(i,0,N){ 
		cin>>a>>b;
		result=fn(S,a-1,b-1);
		S=result;
	}
	cout<<result<<endl;
	return 0;
}

Submission Info

Judge Result