Submission #890749
Source Code Expand
#include <cmath> #include <vector> #include <map> #include <functional> #include <queue> #include <iostream> #include <string> #include <iomanip> #include <algorithm> #include <functional> #include <cstdint> #include <climits> #include <unordered_set> using namespace std; #define ll long long int #define ti4 tuple<int,int,int,int> #define pii pair<ll,ll> #define REP(x,n) for(int x = 0;x < n;x++) template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ std::fill( (T*)array, (T*)(array+N), val ); } struct UnionFind { vector<int> data; UnionFind(int size) : data(size, -1) { } bool unionSet(int x, int y) { x = root(x); y = root(y); if (x != y) { if (data[y] < data[x]) swap(x, y); data[x] += data[y]; data[y] = x; } return x != y; } bool findSet(int x, int y) { return root(x) == root(y); } int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); } int size(int x) { return -data[root(x)]; } }; const ll mod = (ll)(1e9+7); struct SimpleHash { size_t operator()(const std::pair<ll, ll>& p) const { return p.first * mod + p.second; } }; ll gcd( ll a, ll b ) { ll c; while ( a != 0 ) { c = a; a = b%a; b = c; } return b; } ll lcm( ll m, ll n ) { if ( ( 0 == m ) || ( 0 == n ) ) return 0; return ((m / gcd(m, n)) * n); } int main() { string s; cin >> s; for(int i = 0;i < 4;i++) { cout << s[i]; } cout << " "; for(int i = 4;i < s.length();i++) { cout << s[i]; } cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - CODEFESTIVAL 2016 |
User | nanophoto |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1774 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 | 3 ms | 256 KB |
1_02.txt | AC | 3 ms | 256 KB |