Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <iomanip>
- #include <cmath>
- #include <algorithm>
- #include <cstdlib>
- #include <limits.h>
- #include <string>
- #define ll long long
- using namespace std;
- void Fast_IO();
- void Rofyda_Elghadban(){
- #ifndef ONLINE_JUDGE
- freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
- #endif
- }
- int main()
- { Rofyda_Elghadban();
- //Fast_IO();
- //freopen("input.txt","r",stdin);
- //freopen("output.txt","r",stdout);
- int size,t;
- cin>>size>>t;
- string s;
- cin>>s;
- string n;
- int num1,num2;
- while(t--){
- cin>>n;
- if(n=="pop_back"){
- s.pop_back();
- }else if(n=="front"){
- cout<<s.front()<<endl;
- }else if(n=="back"){
- cout<<s.back()<<endl;
- }else if(n=="sort"){
- cin>>num1>>num2;
- sort(s.begin()+min(num1,num2)-1,s.begin()+max(num1,num2));
- }else if(n=="reverse"){
- cin>>num1>>num2;
- reverse(s.begin()+min(num1,num2)-1,s.begin()+max(num1,num2));
- }else if(n=="print"){
- int pos;
- cin>>pos;
- cout<<s[pos-1];
- }else if(n=="substr"){
- cin>>num1>>num2;
- for(int i=min(num1,num2)-1;i<=max(num1,num2)-1;i++){
- cout<<s[i];
- }
- cout<<endl;
- }else{
- char ch;
- cin>>ch;
- s.push_back(ch);
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement