Submission #74841036

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define int long long
#define T int t;cin>>t;while(t--)

const int N=2e5+5;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f3f3f3f3f;

void solve(){
    int n;
    string s;
    cin>>n>>s;
    int pos=n;
    for(int i=0;i<n;i++){
        if(s[i]!='o'){
            pos=i;
            break;
        }
    }
    for(int i=pos;i<n;i++){
        cout<<s[i];
    }
    cout<<endl;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    //T
    solve();
    return 0;
}

Submission Info

Judge Result