Submission #890677
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define pii pair<int,int>
#define files1 freopen("input.txt","r",stdin)
#define files2 freopen("output.txt","w",stdout)
#define files files1;files2
#define fast_io ios_base::sync_with_stdio(0);cin.tie(0)
#define endl '\n'
#define ln(i,n) " \n"[(i) == (n) - 1]
void bad(string mes = "Impossible"){cout << mes;exit(0);}
template<typename ... T> void shit(T& ... x){}
template<typename ... T> void dec(T& ... x){shit(--x...);}
template<typename ... T> void inc(T& ... x){shit(++x...);}
#include <unordered_map>
// #include <unordered_mda>
template<typename T>
string bin(T x, int st = 2){
string ans = "";
while (x > 0){
ans += char('0' + x % st);
x /= st;
}
reverse(ans.begin(), ans.end());
return ans.empty() ? "0" : ans;
}
template<typename T>
T input(){
T ans = 0, m = 1;
char c = ' ';
while (!((c >= '0' && c <= '9') || c == '-')) {
c = getchar();
}
if (c == '-')
m = -1, c = getchar();
while (c >= '0' && c <= '9'){
ans = ans * 10 + (c - '0'), c = getchar();
}
return ans * m;
}
template<typename T>
void read(T& a) {
a = input<T>();
}
template<typename T>
void read(T& a, T& b) {
read(a), read(b);
}
template<typename T>
void read(T& a, T& b, T& c) {
read(a, b), read(c);
}
template<typename T>
void read(T& a, T& b, T& c, T& d) {
read(a, b), read(c, d);
}
const int inf = 1e9;
const double eps = 1e-9;
const int maxn = 1e5 + 10, base = 1e9 + 7;
const ll llinf = 1e18 + 1;
template<typename T>
T binpow(T n, T s)
{
if (s <= 0)
return 1LL;
if (s % 2 == 0){
T b = binpow(n, s / 2);
return ( 1LL * b * b ) % base;
} else {
return (1LL* binpow(n, s - 1) * n) % base;
}
}
int main() {
string s;
// files1;
cin >> s;
cout << string(s.substr(0, 4) + " " + s.substr(4, 8)) << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - CODEFESTIVAL 2016 |
User |
hloya_ygrt |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2201 Byte |
Status |
AC |
Exec Time |
3 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_00.txt, 0_01.txt, 0_02.txt |
All |
0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt |
Case Name |
Status |
Exec Time |
Memory |
0_00.txt |
AC |
2 ms |
256 KB |
0_01.txt |
AC |
2 ms |
256 KB |
0_02.txt |
AC |
2 ms |
256 KB |
1_00.txt |
AC |
3 ms |
256 KB |
1_01.txt |
AC |
2 ms |
256 KB |
1_02.txt |
AC |
2 ms |
256 KB |