Submission #622377
Source Code Expand
#include <iostream> #include <iomanip> #include <sstream> #include <vector> #include <string> #include <set> #include <unordered_set> #include <map> #include <unordered_map> #include <stack> #include <queue> #include <deque> #include <algorithm> #include <functional> #include <iterator> #include <limits> #include <numeric> #include <utility> #include <cmath> #include <cassert> #include <cstdio> using namespace std; using namespace placeholders; using LL = long long; using ULL = unsigned long long; using VI = vector< int >; using VVI = vector< vector< int > >; using VS = vector< string >; using SS = stringstream; using PII = pair< int, int >; using VPII = vector< pair< int, int > >; template < typename T = int > using VT = vector< T >; template < typename T = int > using VVT = vector< vector< T > >; template < typename T = int > using LIM = numeric_limits< T >; template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; } template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; } template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; } template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); } #define REP2( i, n ) REP3( i, 0, n ) #define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i ) #define GET_REP( a, b, c, F, ... ) F #define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2 )( __VA_ARGS__ ) #define FOR( e, c ) for ( auto &e : c ) #define ALL( c ) begin( c ), end( c ) #define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t ) #define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + ( p ), ( c ).end() #define SZ( v ) ( (int)( v ).size() ) #define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() ) template < typename T > inline void chmin( T &a, const T &b ){ a = std::min( a, b ); } template < typename T > inline void chmax( T &a, const T &b ){ a = std::max( a, b ); } #define PB push_back #define EM emplace #define EB emplace_back #define BI back_inserter #define MP make_pair #define fst first #define snd second #define DUMP( x ) cerr << #x << " = " << ( x ) << endl const string S = "DiscoPresentsDiscoveryChannelProgrammingContest2016"; int main() { cin.tie( 0 ); ios::sync_with_stdio( false ); int W; cin >> W; REP( i, SZ( S ) ) { if ( i && i % W == 0 ) { cout << '\n'; } cout << S[i]; } cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - DISCO presents ディスカバリーチャンネルプログラミングコンテスト 2016 |
User | torus711 |
Language | C++11 (GCC 4.9.2) |
Score | 100 |
Code Size | 2686 Byte |
Status | AC |
Exec Time | 106 ms |
Memory | 932 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 | 804 KB |
example_02.txt | AC | 23 ms | 924 KB |
example_03.txt | AC | 23 ms | 800 KB |
test_01.txt | AC | 26 ms | 932 KB |
test_02.txt | AC | 24 ms | 800 KB |
test_03.txt | AC | 24 ms | 800 KB |
test_04.txt | AC | 26 ms | 928 KB |
test_05.txt | AC | 26 ms | 800 KB |
test_06.txt | AC | 23 ms | 928 KB |
test_07.txt | AC | 25 ms | 928 KB |
test_08.txt | AC | 26 ms | 928 KB |
test_09.txt | AC | 26 ms | 804 KB |
test_10.txt | AC | 26 ms | 928 KB |
test_11.txt | AC | 26 ms | 924 KB |
test_12.txt | AC | 26 ms | 928 KB |
test_13.txt | AC | 24 ms | 928 KB |
test_14.txt | AC | 26 ms | 796 KB |
test_15.txt | AC | 23 ms | 924 KB |
test_16.txt | AC | 25 ms | 804 KB |
test_18.txt | AC | 23 ms | 924 KB |
test_19.txt | AC | 26 ms | 916 KB |
test_20.txt | AC | 25 ms | 928 KB |
test_21.txt | AC | 24 ms | 800 KB |
test_22.txt | AC | 24 ms | 808 KB |
test_23.txt | AC | 25 ms | 924 KB |
test_24.txt | AC | 28 ms | 928 KB |
test_25.txt | AC | 106 ms | 752 KB |
test_26.txt | AC | 25 ms | 928 KB |
test_27.txt | AC | 33 ms | 0 KB |
test_28.txt | AC | 26 ms | 808 KB |
test_29.txt | AC | 25 ms | 796 KB |
test_30.txt | AC | 26 ms | 804 KB |
test_31.txt | AC | 25 ms | 800 KB |
test_32.txt | AC | 26 ms | 812 KB |
test_33.txt | AC | 24 ms | 920 KB |
test_34.txt | AC | 26 ms | 808 KB |
test_35.txt | AC | 24 ms | 796 KB |
test_36.txt | AC | 26 ms | 800 KB |
test_37.txt | AC | 26 ms | 804 KB |
test_38.txt | AC | 24 ms | 804 KB |
test_39.txt | AC | 26 ms | 736 KB |
test_41.txt | AC | 26 ms | 796 KB |
test_42.txt | AC | 26 ms | 808 KB |
test_43.txt | AC | 26 ms | 796 KB |
test_44.txt | AC | 26 ms | 796 KB |
test_45.txt | AC | 24 ms | 920 KB |
test_46.txt | AC | 26 ms | 808 KB |
test_47.txt | AC | 24 ms | 924 KB |
test_48.txt | AC | 25 ms | 924 KB |
test_49.txt | AC | 26 ms | 804 KB |
test_50.txt | AC | 26 ms | 840 KB |