Submission #1089703


Source Code Expand

/* template.cpp {{{ */
#include <bits/stdc++.h>
using namespace std;
#define get_macro(a, b, c, d, name, ...) name
#define rep(...) get_macro(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(...) get_macro(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define rep1(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, b) rep4(i, a, b, 1)
#define rep4(i, a, b, s) for (ll i = (a); i < (ll)(b); i += (ll)(s))
#define rrep1(n) rrep2(i_, n)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, a, b) rrep4(i, a, b, 1)
#define rrep4(i, a, b, s) for (ll i = (ll)(b) - 1; i >= (ll)(a); i -= (ll)(s))
#define each(x, c) for (auto &&x : c)
#define fs first
#define sc second
#define all(c) begin(c), end(c)
using ui = unsigned;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const int inf = (int)1e9 + 10;
const ll inf_ll = (ll)1e18 + 10;
const ll mod = 1e9 + 7;
const ll mod9 = 1e9 + 9;
const int dx[]{-1, 0, 1, 0, -1, 1, 1, -1};
const int dy[]{0, -1, 0, 1, -1, -1, 1, 1};
template<class T, class U> void chmin(T &x, const U &y){ x = min<T>(x, y); }
template<class T, class U> void chmax(T &x, const U &y){ x = max<T>(x, y); }
struct prepare_ { prepare_(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(12); } } prepare__;
/* }}} */

int main(){
  string s = "DiscoPresentsDiscoveryChannelProgrammingContest2016";
	int w;
  cin >> w;
  rep(i, s.size()){
    if (i && i % w == 0) cout << "\n";
    cout << s[i];
  }
  cout << endl;
}

Submission Info

Submission Time
Task A - DISCO presents ディスカバリーチャンネルプログラミングコンテスト 2016
User jin_matakich
Language C++11 (GCC 4.9.2)
Score 100
Code Size 1564 Byte
Status AC
Exec Time 35 ms
Memory 928 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 51
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 17 ms 800 KB
example_02.txt AC 17 ms 800 KB
example_03.txt AC 17 ms 800 KB
test_01.txt AC 17 ms 804 KB
test_02.txt AC 19 ms 800 KB
test_03.txt AC 18 ms 920 KB
test_04.txt AC 19 ms 928 KB
test_05.txt AC 17 ms 800 KB
test_06.txt AC 19 ms 924 KB
test_07.txt AC 17 ms 800 KB
test_08.txt AC 17 ms 920 KB
test_09.txt AC 19 ms 928 KB
test_10.txt AC 19 ms 896 KB
test_11.txt AC 17 ms 800 KB
test_12.txt AC 19 ms 924 KB
test_13.txt AC 18 ms 908 KB
test_14.txt AC 17 ms 792 KB
test_15.txt AC 20 ms 752 KB
test_16.txt AC 19 ms 924 KB
test_18.txt AC 18 ms 924 KB
test_19.txt AC 35 ms 736 KB
test_20.txt AC 19 ms 928 KB
test_21.txt AC 19 ms 844 KB
test_22.txt AC 18 ms 796 KB
test_23.txt AC 18 ms 788 KB
test_24.txt AC 19 ms 796 KB
test_25.txt AC 18 ms 928 KB
test_26.txt AC 19 ms 800 KB
test_27.txt AC 17 ms 924 KB
test_28.txt AC 18 ms 788 KB
test_29.txt AC 19 ms 800 KB
test_30.txt AC 19 ms 796 KB
test_31.txt AC 18 ms 920 KB
test_32.txt AC 18 ms 792 KB
test_33.txt AC 18 ms 792 KB
test_34.txt AC 19 ms 800 KB
test_35.txt AC 19 ms 920 KB
test_36.txt AC 19 ms 916 KB
test_37.txt AC 19 ms 872 KB
test_38.txt AC 19 ms 928 KB
test_39.txt AC 17 ms 800 KB
test_41.txt AC 17 ms 800 KB
test_42.txt AC 18 ms 920 KB
test_43.txt AC 18 ms 912 KB
test_44.txt AC 19 ms 928 KB
test_45.txt AC 19 ms 796 KB
test_46.txt AC 19 ms 800 KB
test_47.txt AC 18 ms 920 KB
test_48.txt AC 19 ms 800 KB
test_49.txt AC 18 ms 924 KB
test_50.txt AC 19 ms 924 KB