#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);
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 ms |
312 KB |
Output is correct |
| 3 |
Correct |
0 ms |
208 KB |
Output is correct |
| 4 |
Correct |
0 ms |
208 KB |
Output is correct |
| 5 |
Correct |
0 ms |
444 KB |
Output is correct |
| 6 |
Correct |
1 ms |
208 KB |
Output is correct |
| 7 |
Correct |
0 ms |
312 KB |
Output is correct |
| 8 |
Correct |
0 ms |
208 KB |
Output is correct |
| 9 |
Correct |
1 ms |
320 KB |
Output is correct |
| 10 |
Correct |
0 ms |
316 KB |
Output is correct |
| 11 |
Correct |
0 ms |
208 KB |
Output is correct |
| 12 |
Correct |
0 ms |
320 KB |
Output is correct |
| 13 |
Correct |
0 ms |
208 KB |
Output is correct |
| 14 |
Correct |
0 ms |
208 KB |
Output is correct |
| 15 |
Correct |
0 ms |
316 KB |
Output is correct |
| 16 |
Correct |
0 ms |
312 KB |
Output is correct |
| 17 |
Correct |
0 ms |
312 KB |
Output is correct |
| 18 |
Correct |
0 ms |
316 KB |
Output is correct |
| 19 |
Correct |
0 ms |
208 KB |
Output is correct |
| 20 |
Correct |
1 ms |
208 KB |
Output is correct |
