Submission #891413

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>

using namespace std;
#define inf 0x3f3f3f3f
#define fast ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define mp make_pair
#define pb push_back
#define sz(v) (int)v.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)

typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
const int N=1e5+7;
ll n,m,x,y,k,ans;
int main(){
    fast;
    string s;
    char t[20];
    cin>>s;
    forn(i,4) t[i]=s[i];
    t[4]=' ';
    for(int i=4;i<12;i++){
        t[i+1]=s[i];
    }
    cout<<t<<endl;
    return 0;
}

Submission Info

Judge Result