Submission #890183
Source Code Expand
#include <bits/stdc++.h> #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define FFOR(i,a,b) for(int i=(a);i<=(b);i++) #define REP(i,b) FOR(i,0,b) #define RREP(i,b) FFOR(i,1,b) #define PB push_back #define F first #define S second #define BE(c) c.begin(),c.end() using namespace std; typedef long long LL; typedef LL ut; typedef long double ld; typedef pair<ut,ut> pr; typedef vector<pr> Vpr; typedef vector<ut> VI; typedef pair<ut,pr> ppr; typedef priority_queue<pr,Vpr, greater<pr> > PQ; const int SIZE=5+3*1e+4; const ut INF=1<<30; const ld eps=1e-6; const LL mod=7+1e+9; int main() { string s; cin >> s; cout << s.substr(0, 4) << " " << s.substr(4, 8) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - CODEFESTIVAL 2016 |
User | spade630 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 713 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 | 3 ms | 256 KB |
0_01.txt | AC | 3 ms | 256 KB |
0_02.txt | AC | 3 ms | 256 KB |
1_00.txt | AC | 3 ms | 256 KB |
1_01.txt | AC | 2 ms | 256 KB |
1_02.txt | AC | 3 ms | 256 KB |