Submission #890139


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
const int dx[]={1,0,-1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,1,1,-1,-1};
const int INF = 1e9;
const long long LINF = 1e18;
const double EPS = 1e-8;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define ll long long
#define reps(i,j,k) for(int i = (j); i < (k); ++i)
#define rep(i,j) reps(i,0,j)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
typedef pair<int,int> Pii;
typedef vector<int> vi;
typedef pair<string, int> Psi;
typedef pair<ll, ll> Pll;
int main(){

	string a;
	cin >> a;
	rep(i,a.size()){
		cout << a[i];
		if(i == 3){
			cout << " ";
		}
	}

	return 0;
}

Submission Info

Submission Time
Task A - CODEFESTIVAL 2016
User chigichan24
Language C++14 (GCC 5.4.1)
Score 0
Code Size 692 Byte
Status WA
Exec Time 9 ms
Memory 764 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 3
WA × 6
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 WA 9 ms 764 KB
0_01.txt WA 3 ms 256 KB
0_02.txt WA 2 ms 256 KB
1_00.txt WA 3 ms 256 KB
1_01.txt WA 2 ms 256 KB
1_02.txt WA 2 ms 256 KB