Submission #890580
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> #include <deque> #include <queue> #include <list> #include <stack> #include <string> #include <functional> #include <numeric> #include <cmath> #include <iomanip> #include <map> #include <set> #include <cstdlib> #define INF 100000000 #define _INF -100000000 #define INFLL (long long)1e14 #define _INFLL (long long)-1e14 #define Loop(i, n) for(int i = 0; i < (int)n; i++) #define Loop1(i, n) for(int i = 1; i <= (int)n; i++) #define Loopr(i, n) for(int i = (int)n - 1; i >= 0; i--) #define Loopr1(i, n) for(int i = (int)n; i >= 1; i--) using namespace std; typedef long long int ll; typedef vector<int> vi; typedef vector<vector<int>> vvi; typedef vector<ll> vll; typedef vector<vector<ll>> vvll; typedef pair<ll, ll> P; int main() { string s; cin >> s; s.insert(4, " "); cout << s << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - CODEFESTIVAL 2016 |
User | mao |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 901 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 | 3 ms | 256 KB |
0_02.txt | AC | 2 ms | 256 KB |
1_00.txt | AC | 2 ms | 256 KB |
1_01.txt | AC | 2 ms | 256 KB |
1_02.txt | AC | 2 ms | 256 KB |