Submission #1257125

#TimeUsernameProblemLanguageResultExecution timeMemory
1257125islam_2010Split (info1cup19_split)C++20
100 / 100
0 ms328 KiB
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;

// typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pii pair<int, int>
#define mpr make_pair
#define fi first
#define se second
#define int long long
#define Local
const int sz = 1e6+5;
const int inf = 1e9 + 7;
const int mod = 998244353;



int bin_pow(int x, int b) {
	int res = 1;
	while (b > 0) {
		if (b & 1) {
			res = (res * x) % mod;
		}
		x = (x * x) % mod;
		b >>= 1;
	}
	return res;
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
    #ifdef Local
        // freopen("main.in", "r", stdin);
        // freopen("main.out", "w", stdout);
    #endif

    string s;
    cin >> s;
    cout << s.substr(0, s.size()/2) << " " << s.substr(s.size()/2, s.size()/2);


    
}



#Verdict Execution timeMemoryGrader output
Fetching results...