Submission #890314


Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)

int main(void){
	string s; cin >> s;
	rep(i, s.size()){
		if(i == 4){
			cout << ' ';
		}
		cout << s[i];
	}
	return 0;
}

Submission Info

Submission Time
Task A - CODEFESTIVAL 2016
User mmxsrup
Language C++14 (GCC 5.4.1)
Score 0
Code Size 714 Byte
Status WA
Exec Time 2 ms
Memory 256 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 2 ms 256 KB
0_01.txt WA 2 ms 256 KB
0_02.txt WA 2 ms 256 KB
1_00.txt WA 2 ms 256 KB
1_01.txt WA 2 ms 256 KB
1_02.txt WA 2 ms 256 KB