Submission #966662


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using vl=vector<long long>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
#define ITR(v,c) for(auto v=begin(c);v!=end(c);v++)
#define FORE(x,c) for(auto &x:c)
#define FOR(v,a,n) for(int v=a;v<(int)(n);v++)
#define REP(v,n) FOR(v,0,n)
#define RREP(v,n) for(int v=((int)(n)-1);v>=0;v--)
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define SZ(c) ((int)c.size())
const int DX[9]={0,1,0,-1,1,1,-1,-1,0}, DY[9]={-1,0,1,0,-1,1,1,-1,0};
const int INF=1e9; const long long INFLL=1e18;
template<class T> ostream& operator << (ostream &os, const vector<T> &v) {
    ITR(i,v) os<<*i<<(i==end(v)-1?"":"\n"); return os; }
template<class T> istream& operator >> (istream &is, vector<T> &v) {
    ITR(i,v) is>>*i; return is; }
//------------------------------------------------------------------------------

int w;
void rec(string s) {
    if(SZ(s)<=w) {
        cout<<s<<endl;
        return;
    }
    cout<<s.substr(0,w)<<endl;
    rec(s.substr(w,SZ(s)-w));
}
signed main() {
    cin>>w;
    string s="DiscoPresentsDiscoveryChannelProgrammingContest2016";
    rec(s);
    return 0;
}

Submission Info

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