Submission #890254
Source Code Expand
#include <iostream> #include <cstdio> #include <string> #include <string.h> #include <queue> #include <math.h> #include <cmath> #include <map> #include <set> #include <vector> #include <algorithm> #include <bitset> #include <list> #include <ctype.h> #include <cassert> #include <stack> #include <fstream> #include <unordered_map> #include <unordered_set> #include <ctime> #include <functional> #include <ctime> #include <limits> #include <tuple> #include <complex> #include <numeric> using namespace std; #define snd second #define fst first #define mp make_pair #define ll long long #define ull unsigned long long #define ld long double #define pb push_back #define left _left #define right _right const ld pi = acos(-1.0l); template<typename T> T abs(T x) { return x > 0 ? x : -x; } template<typename T> T sqr(T x) { return x * x; } template<typename T> bool chmin(T &x, T y) { if (x > y) { x = y; return true; } return false; } template<typename T> bool chmax(T &x, T y) { if (x < y) { x = y; return true; } return false; } template<typename U, typename V> ostream &operator<<(ostream &s, const pair<U, V> &x) { s << "(" << x.fst << ", " << x.snd << ")"; return s; } template<typename U> ostream &operator<<(ostream &s, const vector<U> &x) { s << "["; bool was = false; for (auto it : x) { if (was) { s << ", "; } was = true; s << it; } s << "]"; return s; } template<typename U> ostream &operator<<(ostream &s, const set<U> &x) { s << "{"; bool was = false; for (auto it : x) { if (was) { s << ", "; } was = true; s << it; } s << "}"; return s; } template<int sz> ostream operator<<(ostream &s, const bitset<sz> &x) { for (int i = 0; i < sz; i++) { s << x[i]; } return s; } //----------------------------------------------------------------------------- int main() { srand(time(NULL)); retry: #ifdef LOCAL // gen(); freopen("a.in", "r", stdin); //freopen("a.out", "w", stdout); #else //freopen(".in", "r", stdin); //freopen(".out", "w", stdout); #endif string s; cin >> s; for (int i = 0; i < 12; i++) { if (i == 4) { cout << " "; } cout << s[i]; } cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - CODEFESTIVAL 2016 |
User | avolchek |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2561 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 | 3 ms | 256 KB |
1_02.txt | AC | 3 ms | 256 KB |