Edit - Code Golf Stack Exchange

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

Rev

Required fields*

Triangulating Text

Write a program or function that takes in a string guaranteed to only contain printable ASCII characters except for space, and to be a positive triangular number (1, 3, 6, 10, 15, ...) in length.

Print or return the same string, but shaped into a triangle using spaces. Some examples will best show what I mean:

If the input is R then the output will be

If the input is cat then the output will be

 c
a t

If the input is monk3y then the output will be

 m
 o n
k 3 y

If the input is meanIngfu1 then the output will be

 m
 e a
 n I n
g f u 1

If the input is ^/\/|\/[]\ then the output will be

 ^
 / \
 / | \
/ [ ] \

If the input is

Thisrunofcharactersismeanttohavealengththatcanbeexpressedasatriangularnumber.Diditwork?Youtellme,Ican'tcountverywell,ok?

then the output will be

 T
 h i
 s r u
 n o f c
 h a r a c
 t e r s i s
 m e a n t t o
 h a v e a l e n
 g t h t h a t c a
 n b e e x p r e s s
 e d a s a t r i a n g
 u l a r n u m b e r . D
 i d i t w o r k ? Y o u t
 e l l m e , I c a n ' t c o
u n t v e r y w e l l , o k ?

Basically, newlines are inserted between the substrings of triangular length, spaces are added between all characters, and each line is indented with spaces to fit the triangle shape.

A single trailing newline and lines with trailing spaces are optionally allowed, but otherwise your output should exactly match these examples. The last line of the triangle should not have leading spaces.

The shortest code in bytes wins.

Answer*

## [Retina](https://github.com/mbuettner/retina), <s>108</s> <s>102</s> <s>94</s> <s>87</s> <s>82</s> <s>64</s> 63 bytes

Thanks to Sp3000 for making me pursue my original approach, which brought the byte count from 108 down to 82.

*Massive thanks to Kobi who found a much more elegant solution, which allowed me to save another 19 bytes on top of that.*

 S_`(?<=^(?<-1>.)*(?:(?<=\G(.)*).)+)
 .
 0ドル 
 m+`^(?=( *)\S.*\n1円)
 <space>

Where `<space>` represents a single space character (which would otherwise be stripped by SE). For counting purposes, each line goes in a separate file and `\n` should be replaced with an actual linefeed character. For convenience, you can run the code as is from a single file with the `-s` flag.

[Try it online.](http://retina.tryitonline.net/#code=U19gKD88PV4oPzwtMT4uKSooPzooPzw9XEcoLikqKS4pKykKLgokMCAKbStgXig_PSggKilcUy4qXG5cMSkKIA&input=VGhpc3J1bm9mY2hhcmFjdGVyc2lzbWVhbnR0b2hhdmVhbGVuZ3RodGhhdGNhbmJlZXhwcmVzc2VkYXNhdHJpYW5ndWxhcm51bWJlci5EaWRpdHdvcms_WW91dGVsbG1lLEljYW4ndGNvdW50dmVyeXdlbGwsb2s_)

### Explanation

Well... as usual I can't give a full introduction to balancing groups here. For a primer [see my Stack Overflow answer](https://stackoverflow.com/a/17004406/1633117).

 S_`(?<=^(?<-1>.)*(?:(?<=\G(.)*).)+)

The first stage is a `S`plit stage, which splits the input into lines of increasing length. The `_` indicates that empty chunks should be omitted from the splitting (which only affects the end, because there will be a match in the last position). The regex itself is entirely contained in a look-around so it won't match any characters, but only positions.

This part is based on Kobi's solution with some additional golfitude I found myself. Note that lookbehinds are matched right-to-left in .NET, so the following explanation should best be read bottom to top. I've also inserted another `\G` in the explanation for clarity, although that isn't necessary for the pattern to work.

 (?<=
 ^ # And we ensure that we can reach the beginning of the stack by doing so.
 # The first time this is possible will be exactly when tri(m-1) == tri(n-1),
 # i.e. when m == n. Exactly what we want!
 (?<-1>.)* # Now we keep matching individual characters while popping from group <1>.
 \G # We've now matched m characters, while pushing i-1 captures for each i
 # between 1 and m, inclusive. That is, group <1> contains tri(m-1) captures.
 (?: 
 (?<=
 \G # The \G anchor matches at the position of the last match.
 (.)* # ...push one capture onto group <1> for each character between here
 # here and the last match.
 ) # Then we use a lookahead to...
 . # In each iteration we match a single character.
 )+ # This group matches all the characters up to the last match (or the beginning
 # of the string). Call that number m.
 ) # If the previous match was at position tri(n-1) then we want this match
 # to happen exactly n characters later.

I'm still admiring Kobi's work here. This is even more elegant than the prime testing regex. :)

Let's move on to the next stage:

 .
 0ドル 

Simple: insert a space after every non-linefeed character.

 m+`^(?=( *)\S.*\n1円)
 <space>

This last stage indents all the lines correctly to form the triangle. The `m` is just the usual multiline mode to make `^` match the beginning of a line. The `+` tells Retina to repeat this stage until the string stops changing (which, in this case means that the regex no longer matches).

 ^ # Match the beginning of a line.
 (?= # A lookahead which checks if the matched line needs another space.
 ( *) # Capture the indent on the current line.
 \S # Match a non-space character to ensure we've got the entire indent.
 .*\n # Match the remainder of the line, as well as the linefeed.
 1円 # Check that the next line has at least the same indent as this one.
 )

So this matches the beginning of any line which doesn't have a bigger indent than the next. In any such position we insert a space. This process terminates, once the lines are arranged in a neat triangle, because that's the minimal layout where each line has a bigger indent than the next.

If this is an answer to a challenge…

…Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.
…Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one. Explanations of your answer make it more interesting to read and are very much encouraged.
…Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.

More generally…

…Please make sure to answer the question and provide sufficient detail.
…Avoid asking for help, clarification or responding to other answers (use comments instead).

Draft saved

Draft discarded

Edit Summary*

Cancel

\$\begingroup\$ @_@ What the heck does it do? \$\endgroup\$

n̴̖̋h̷͉̃a̷̭̿h̸̡̅ẗ̵̨́d̷̰̀ĥ̷̳
– n̴̖̋h̷͉̃a̷̭̿h̸̡̅ẗ̵̨́d̷̰̀ĥ̷̳

2015年12月01日 07:30:42 +00:00
Commented Dec 1, 2015 at 7:30
\$\begingroup\$ @n̴̖̋h̷͉̃a̷̭̿h̸̡̅ẗ̵̨́d̷̰̀ĥ̷̳ Now with 100% more amazingness, courtesy of Kobi. \$\endgroup\$

Martin Ender
– Martin Ender

2015年12月01日 20:13:01 +00:00
Commented Dec 1, 2015 at 20:13

Add a comment |

How to Edit

Correct minor typos or mistakes
Clarify meaning without changing it
Add related resources or links
Always respect the author’s intent
Don’t use edits to reply to the author

How to Format

create code fences with backticks ` or tildes ~
```
like so
```
add language identifier to highlight code
```python
def function(foo):
print(foo)
```
put returns between paragraphs
for linebreak add 2 spaces at end
_italic_ or **bold**
indent code by 4 spaces
backtick escapes `like _so_`
quote by placing > at start of line
to make links (use https whenever possible)

<https://example.com>

[example](https://example.com)

<a href="https://example.com">example</a>
MathJax equations \$\sin^2 \theta\$

formatting help »
answering help »

MathJax help »

How to Tag

A tag is a keyword or label that categorizes your question with other, similar questions. Choose one or more (up to 5) tags that will help answerers to find and interpret your question.

complete the sentence: my question is about...
use tags that describe things or concepts that are essential, not incidental to your question
favor using existing popular tags
read the descriptions that appear below the tag

If your question is primarily about a topic for which you can't find a tag:

combine multiple words into single-words with hyphens (e.g. code-golf), up to a maximum of 35 characters
creating new tags is a privilege; if you can't yet create a tag you need, then post this question without it, then ask the community to create it for you

popular tags »