Submission #622366


Source Code Expand

#define _CRT_SECURE_NO_DEPRECATE

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <ctime>
#include <cassert>
#include <map>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <stack>
#include <queue>
#include <numeric>
#include <iterator>
#include <bitset>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
#define ten(x) ((int)1e##x)

// #pragma comment(linker,"/STACK:36777216")

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }

template<class T> void chmax(T& l, const T r) { l = max(l, r); }
template<class T> void chmin(T& l, const T r) { l = min(l, r); }
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}

#include <unordered_map>
#include <unordered_set>

int main() {
	int w; cin >> w;
	string s = "DiscoPresentsDiscoveryChannelProgrammingContest2016";
	FOR(i, sz(s)) {
		putchar(s[i]);
		if ((i + 1) % w == 0) puts("");
	}
	if (sz(s) % w != 0) puts("");
	
	return 0;
}

Submission Info

Submission Time
Task A - DISCO presents ディスカバリーチャンネルプログラミングコンテスト 2016
User math
Language C++11 (GCC 4.9.2)
Score 100
Code Size 3924 Byte
Status AC
Exec Time 30 ms
Memory 932 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 25 ms 800 KB
example_02.txt AC 25 ms 800 KB
example_03.txt AC 26 ms 800 KB
test_01.txt AC 26 ms 800 KB
test_02.txt AC 26 ms 924 KB
test_03.txt AC 26 ms 916 KB
test_04.txt AC 26 ms 800 KB
test_05.txt AC 26 ms 796 KB
test_06.txt AC 27 ms 800 KB
test_07.txt AC 26 ms 804 KB
test_08.txt AC 27 ms 796 KB
test_09.txt AC 27 ms 796 KB
test_10.txt AC 28 ms 804 KB
test_11.txt AC 26 ms 804 KB
test_12.txt AC 27 ms 804 KB
test_13.txt AC 27 ms 792 KB
test_14.txt AC 27 ms 804 KB
test_15.txt AC 29 ms 796 KB
test_16.txt AC 26 ms 932 KB
test_18.txt AC 26 ms 800 KB
test_19.txt AC 25 ms 928 KB
test_20.txt AC 26 ms 804 KB
test_21.txt AC 28 ms 804 KB
test_22.txt AC 27 ms 792 KB
test_23.txt AC 26 ms 836 KB
test_24.txt AC 30 ms 676 KB
test_25.txt AC 26 ms 920 KB
test_26.txt AC 27 ms 920 KB
test_27.txt AC 26 ms 728 KB
test_28.txt AC 27 ms 916 KB
test_29.txt AC 26 ms 924 KB
test_30.txt AC 26 ms 920 KB
test_31.txt AC 25 ms 916 KB
test_32.txt AC 27 ms 796 KB
test_33.txt AC 25 ms 720 KB
test_34.txt AC 24 ms 924 KB
test_35.txt AC 25 ms 804 KB
test_36.txt AC 24 ms 920 KB
test_37.txt AC 25 ms 920 KB
test_38.txt AC 24 ms 784 KB
test_39.txt AC 26 ms 916 KB
test_41.txt AC 25 ms 924 KB
test_42.txt AC 25 ms 916 KB
test_43.txt AC 26 ms 920 KB
test_44.txt AC 25 ms 924 KB
test_45.txt AC 26 ms 804 KB
test_46.txt AC 26 ms 920 KB
test_47.txt AC 25 ms 800 KB
test_48.txt AC 26 ms 728 KB
test_49.txt AC 26 ms 808 KB
test_50.txt AC 26 ms 800 KB