Submission #515999

#TimeUsernameProblemLanguageResultExecution timeMemory
515999Theo830Split (info1cup19_split)C++17
100 / 100
1 ms444 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll INF = 1e9+7; const ll MOD = 998244353; typedef pair<ll,ll> ii; #define iii pair<ll,ii> #define f(i,a,b) for(ll i = a;i < b;i++) #define pb push_back #define vll vector<ll> #define F first #define S second #define all(x) (x).begin(), (x).end() ///I hope I will get uprating and don't make mistakes ///I will never stop programming ///sqrt(-1) Love C++ ///Please don't hack me ///@TheofanisOrfanou Theo830 ///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst) ///Stay Calm ///Look for special cases ///Beware of overflow and array bounds ///Think the problem backwards ///Training int main(void){ ios_base::sync_with_stdio(0); cin.tie(0); string s; cin>>s; ll n = s.size() / 2; cout<<s.substr(0,n)<<" "<<s.substr(n,n); }
#Verdict Execution timeMemoryGrader output
Fetching results...