Brain-Flak, 418 378 228 bytes
This is my Brain-Flak masterpiece. It may not be well golfed but the challenge is the most difficult I have ever encountered.
Try it online!
(([])[()]){({}[()]<(({}(<()>))<{({}[()]<(({}()<(({}<>))>)<({()<({}[()]<({}<({}<>)<>>)>)>}{}<>){({}[()]<({}<>)<>>)}{}>)>)}{}{}
1
It's strange that I haven't seen this, as EXCEL seems to be a valid language for code golfing (despite its 'compiler' not being free).
Excel is somewhat of a wildcard in golfing, being good at golfing challenges of medium complexity, and sometimes simpler challenges as well. More often than not,...
102
Introduction
For this example, let's take the string Hello, World! and the array [3, 2, 3]. To find the substring chain, we go through the following process:
The first number of the array is 3, so we get the substring [0 - 3], which is Hel. After that, we remove the first 3 characters from the ...
V, 38, 37, 36, 34, 33, 32, 31, 30 29 bytes
Àé r\2é/4é-òhYpX$2P^ò3GEòjlr\
Try it online!
I might catch up with Osabie. One byte shorter than Osabie. \o/ Tied with 2sable! One byte shorter!
In other news, this is definitely the longest strikethrough header I've ever made.
Explanation:
Àé ...
Python 3, 45 bytes
f=lambda s,a:f(s[a[0]:print(s[:a.pop(0)])],a)
This prints one substring per line and terminates with an error. Test it on repl.it.
C (gcc), 81 bytes
i,j;f(s,l,k)char*s;int*l;{for(i=j=0;i<k;){write(1,s+j,l[i]);puts("");j+=l[i++];}}
I'm not putting an Ideone link because Clang doesn't output properly :(
test.c:
i,j;f(s,l,k)char*s;int*l;{for(i=j=0;i<k;){write(1,s+j,l[i]);puts("");j+=l[i++];}}
main(){
int l[]={3,2,3};
...1
Turtlèd
Factoid:
The name of turtlèd contains an accent thing. This accent thing means you should pronounce the syllable, rather than not. Example: striped -> straipt, stripèd -> straiped. turtlèd is pronounced turtle-ed, which is kind of appropriate because the turtle edits text on a grid.
1 ...
-1
