Submission #622359


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define MOD @
#define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD)
typedef long long i64; typedef vector<int> ivec; typedef vector<string> svec;

int main()
{
	int W;
	scanf("%d", &W);

	string s = "DiscoPresentsDiscoveryChannelProgrammingContest2016";
	for (int i = 0; i < s.size(); ++i) {
		printf("%c", s[i]);
		if (i % W == W - 1) puts("");
	}
	if (s.size() % W != 0) puts("");

	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:20:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &W);
                 ^

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 27 ms 800 KB
example_02.txt AC 27 ms 804 KB
example_03.txt AC 26 ms 796 KB
test_01.txt AC 27 ms 924 KB
test_02.txt AC 25 ms 924 KB
test_03.txt AC 27 ms 800 KB
test_04.txt AC 27 ms 808 KB
test_05.txt AC 27 ms 804 KB
test_06.txt AC 26 ms 792 KB
test_07.txt AC 27 ms 924 KB
test_08.txt AC 25 ms 796 KB
test_09.txt AC 25 ms 924 KB
test_10.txt AC 24 ms 796 KB
test_11.txt AC 27 ms 804 KB
test_12.txt AC 26 ms 728 KB
test_13.txt AC 26 ms 800 KB
test_14.txt AC 26 ms 808 KB
test_15.txt AC 26 ms 804 KB
test_16.txt AC 27 ms 920 KB
test_18.txt AC 26 ms 800 KB
test_19.txt AC 27 ms 800 KB
test_20.txt AC 25 ms 720 KB
test_21.txt AC 26 ms 804 KB
test_22.txt AC 25 ms 808 KB
test_23.txt AC 27 ms 768 KB
test_24.txt AC 26 ms 804 KB
test_25.txt AC 26 ms 800 KB
test_26.txt AC 26 ms 920 KB
test_27.txt AC 28 ms 920 KB
test_28.txt AC 24 ms 924 KB
test_29.txt AC 25 ms 812 KB
test_30.txt AC 26 ms 932 KB
test_31.txt AC 25 ms 796 KB
test_32.txt AC 26 ms 776 KB
test_33.txt AC 26 ms 796 KB
test_34.txt AC 26 ms 800 KB
test_35.txt AC 26 ms 728 KB
test_36.txt AC 26 ms 796 KB
test_37.txt AC 26 ms 804 KB
test_38.txt AC 26 ms 800 KB
test_39.txt AC 26 ms 792 KB
test_41.txt AC 27 ms 924 KB
test_42.txt AC 26 ms 796 KB
test_43.txt AC 26 ms 808 KB
test_44.txt AC 25 ms 924 KB
test_45.txt AC 26 ms 916 KB
test_46.txt AC 25 ms 728 KB
test_47.txt AC 27 ms 792 KB
test_48.txt AC 26 ms 916 KB
test_49.txt AC 26 ms 804 KB
test_50.txt AC 27 ms 928 KB