Timeline for Is this number triangular?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 8, 2017 at 11:39 | comment | added | Neil |
Make that 74 bytes, thanks to \G!
|
|
| May 23, 2017 at 13:59 | comment | added | Neil | This just saved me 70 bytes: codegolf.stackexchange.com/a/118387 | |
| May 23, 2017 at 4:53 | comment | added | Martin Ender |
@LeakyNun regex engines have an optimisation that they stop repeating a group if it was empty n times where n is the minimum of the quantifier you're using (in your case 1; if the minimum was 0, it would be tried once anyway). If you change the + to {2,}, it should work. This optimisation prevents infinite loops but it's also the only thing that keeps .NET regex from being Turing-complete on its own.
|
|
| May 23, 2017 at 2:39 | comment | added | Leaky Nun |
Why doesn't (^|1\1)+$ work?
|
|
| May 22, 2017 at 20:48 | history | answered | Martin Ender | CC BY-SA 3.0 |