Submission #891095
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define MODULE 1000000007 #define MP make_pair template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;} template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;} typedef pair<int, int> P; typedef long long LL; const int INF = INT_MAX / 2; //int_max->2*e+9 const int MAXN = 100001; /*struct edge { edge(int to, int cost) : to(to), cost(cost) {} int to, cost; }; vector<edge> graph[MAXN];*/ int dx[4] = {-1, 0, 1, 0}; int dy[4] = {0, -1, 0, 1}; //-----Template--------- char c[12]; int main(){ ios::sync_with_stdio(false); for(int i=0;i<12;i++){ cin>>c[i]; } for(int i=0;i<12;i++){ cout<<c[i]; if(i==3) cout<<" "; } cout<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - CODEFESTIVAL 2016 |
User | yoyoyousei |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 807 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 | 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 |