Submission #622363


Source Code Expand

#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))

// #define DEBUG

#ifdef DEBUG
    #define dump(...) fprintf(stderr, __VA_ARGS__)
#else
    #define dump(...)
#endif

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;

const double eps = 1e-10;
const double pi  = acos(-1.0);
const ll inf =1LL << 62;
const ll mod=1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};

int main(void){
	string s="DiscoPresentsDiscoveryChannelProgrammingContest2016";
	int w;
	cin >> w;
	int n=s.size();
	rep(i,n/w+1) cout << s.substr(w*i,w) << endl;
	return 0;
}

Submission Info

Submission Time
Task A - DISCO presents ディスカバリーチャンネルプログラミングコンテスト 2016
User Hec
Language C++11 (GCC 4.9.2)
Score 0
Code Size 1365 Byte
Status WA
Exec Time 27 ms
Memory 932 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 1
WA × 2
AC × 47
WA × 4
Set Name Test Cases
Sample example_01.txt, example_02.txt, example_03.txt
All example_01.txt, example_02.txt, example_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt
Case Name Status Exec Time Memory
example_01.txt AC 27 ms 796 KB
example_02.txt WA 26 ms 796 KB
example_03.txt WA 27 ms 920 KB
test_01.txt WA 26 ms 924 KB
test_02.txt AC 26 ms 916 KB
test_03.txt WA 26 ms 920 KB
test_04.txt AC 26 ms 804 KB
test_05.txt AC 26 ms 808 KB
test_06.txt AC 26 ms 804 KB
test_07.txt AC 27 ms 796 KB
test_08.txt AC 25 ms 800 KB
test_09.txt AC 26 ms 912 KB
test_10.txt AC 27 ms 924 KB
test_11.txt AC 26 ms 916 KB
test_12.txt AC 26 ms 800 KB
test_13.txt AC 26 ms 932 KB
test_14.txt AC 26 ms 796 KB
test_15.txt AC 26 ms 808 KB
test_16.txt AC 25 ms 920 KB
test_18.txt AC 25 ms 928 KB
test_19.txt AC 25 ms 804 KB
test_20.txt AC 26 ms 924 KB
test_21.txt AC 27 ms 800 KB
test_22.txt AC 26 ms 924 KB
test_23.txt AC 26 ms 792 KB
test_24.txt AC 26 ms 920 KB
test_25.txt AC 26 ms 920 KB
test_26.txt AC 26 ms 804 KB
test_27.txt AC 25 ms 916 KB
test_28.txt AC 24 ms 920 KB
test_29.txt AC 26 ms 916 KB
test_30.txt AC 23 ms 800 KB
test_31.txt AC 26 ms 800 KB
test_32.txt AC 26 ms 804 KB
test_33.txt AC 24 ms 796 KB
test_34.txt AC 26 ms 800 KB
test_35.txt AC 26 ms 804 KB
test_36.txt AC 27 ms 740 KB
test_37.txt AC 25 ms 928 KB
test_38.txt AC 26 ms 800 KB
test_39.txt AC 26 ms 804 KB
test_41.txt AC 26 ms 804 KB
test_42.txt AC 25 ms 800 KB
test_43.txt AC 25 ms 924 KB
test_44.txt AC 26 ms 804 KB
test_45.txt AC 23 ms 916 KB
test_46.txt AC 25 ms 924 KB
test_47.txt AC 24 ms 804 KB
test_48.txt AC 25 ms 796 KB
test_49.txt AC 25 ms 920 KB
test_50.txt AC 25 ms 924 KB