Submission #622490
Source Code Expand
#include <cstdio> #include <iostream> #include <vector> #include <map> #include <unordered_map> #include <set> #include <unordered_set> #include <string> #include <cstring> #include <sstream> #include <algorithm> #include <functional> #include <queue> #include <stack> #include <cmath> #include <iomanip> #include <list> #include <tuple> #include <bitset> #include <ciso646> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll, ll> P; typedef tuple<ll, ll, ll> T; typedef vector<ll> vec; inline bool cheak(ll x, ll y, ll xMax, ll yMax) { return x >= 0 && y >= 0 && xMax > x && yMax > y; } inline int toint(string s) { int v; istringstream sin(s); sin >> v; return v; } template<class T> inline string tostring(T x) { ostringstream sout; sout << x; return sout.str(); } template<class T> inline T sqr(T x) { return x*x; } template<class T> inline T mypow(T x, ll n) { T res = 1; while (n > 0) { if (n & 1)res = res * x; x = x * x; n >>= 1; }return res; } inline int gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; } inline int lcm(ll a, ll b) { return a / gcd(a, b) * b; } #define For(i,a,b) for(ll (i) = (a);i < (b);(i)++) #define rep(i,n) For(i,0,n) #define rFor(i,a,b) for(ll (i) = (a-1);i >= (b);(i)--) #define rrep(i,n) rFor(i,n,0) #define clr(a) memset((a), 0 ,sizeof(a)) #define mclr(a) memset((a), -1 ,sizeof(a)) #define all(a) (a).begin(),(a).end() #define sz(a) (sizeof(a)) #define tostr(a) tostring(a) #define dump(val) cerr << #val " = " << val << endl; #define Fill(a,v) fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v) const ll dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 }; const ll mod = 1e9 + 7; const ll INF = 1e17 + 9; #define int ll signed main() { cin.tie(0); ios_base::sync_with_stdio(false); int w; cin >> w; string s = "DiscoPresentsDiscoveryChannelProgrammingContest2016"; int t = 0; while (1) { rep(i, w) { if (t + i == s.size()) { cout << endl; return 0; } cout << s[t + i]; } t += w; cout << endl; if (t == s.size())return 0; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - DISCO presents ディスカバリーチャンネルプログラミングコンテスト 2016 |
User | omu |
Language | C++11 (GCC 4.9.2) |
Score | 100 |
Code Size | 2184 Byte |
Status | AC |
Exec Time | 28 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 | 24 ms | 804 KB |
example_02.txt | AC | 23 ms | 928 KB |
example_03.txt | AC | 23 ms | 928 KB |
test_01.txt | AC | 25 ms | 924 KB |
test_02.txt | AC | 25 ms | 932 KB |
test_03.txt | AC | 23 ms | 924 KB |
test_04.txt | AC | 25 ms | 792 KB |
test_05.txt | AC | 25 ms | 800 KB |
test_06.txt | AC | 25 ms | 924 KB |
test_07.txt | AC | 25 ms | 800 KB |
test_08.txt | AC | 24 ms | 796 KB |
test_09.txt | AC | 24 ms | 916 KB |
test_10.txt | AC | 26 ms | 920 KB |
test_11.txt | AC | 25 ms | 932 KB |
test_12.txt | AC | 27 ms | 792 KB |
test_13.txt | AC | 28 ms | 792 KB |
test_14.txt | AC | 25 ms | 876 KB |
test_15.txt | AC | 26 ms | 796 KB |
test_16.txt | AC | 24 ms | 792 KB |
test_18.txt | AC | 27 ms | 916 KB |
test_19.txt | AC | 27 ms | 792 KB |
test_20.txt | AC | 24 ms | 916 KB |
test_21.txt | AC | 24 ms | 924 KB |
test_22.txt | AC | 25 ms | 920 KB |
test_23.txt | AC | 23 ms | 792 KB |
test_24.txt | AC | 26 ms | 804 KB |
test_25.txt | AC | 26 ms | 912 KB |
test_26.txt | AC | 25 ms | 916 KB |
test_27.txt | AC | 24 ms | 920 KB |
test_28.txt | AC | 24 ms | 920 KB |
test_29.txt | AC | 24 ms | 924 KB |
test_30.txt | AC | 23 ms | 924 KB |
test_31.txt | AC | 24 ms | 920 KB |
test_32.txt | AC | 23 ms | 800 KB |
test_33.txt | AC | 26 ms | 804 KB |
test_34.txt | AC | 25 ms | 924 KB |
test_35.txt | AC | 25 ms | 928 KB |
test_36.txt | AC | 25 ms | 924 KB |
test_37.txt | AC | 26 ms | 812 KB |
test_38.txt | AC | 25 ms | 800 KB |
test_39.txt | AC | 25 ms | 804 KB |
test_41.txt | AC | 25 ms | 924 KB |
test_42.txt | AC | 24 ms | 928 KB |
test_43.txt | AC | 24 ms | 804 KB |
test_44.txt | AC | 26 ms | 800 KB |
test_45.txt | AC | 23 ms | 928 KB |
test_46.txt | AC | 25 ms | 928 KB |
test_47.txt | AC | 25 ms | 924 KB |
test_48.txt | AC | 25 ms | 928 KB |
test_49.txt | AC | 24 ms | 800 KB |
test_50.txt | AC | 25 ms | 804 KB |