Timeline for N-dimensional N^N array filled with N
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 28, 2017 at 18:02 | history | edited | Trelzevir | CC BY-SA 3.0 |
deleted 10 characters in body
|
| Feb 28, 2017 at 17:59 | comment | added | Adám | @CalculatorFeline I only meant to imply the default rules. I've removed the comment. | |
| Feb 28, 2017 at 17:47 | comment | added | CalculatorFeline | Aren't input and output required in full program submissions? | |
| Feb 28, 2017 at 17:45 | history | edited | Trelzevir | CC BY-SA 3.0 |
added 188 characters in body
|
| Feb 28, 2017 at 17:43 | comment | added | Adám | @CalculatorFeline You can put things in Header and Footer to avoid inclusion in byte count. | |
| Feb 28, 2017 at 17:41 | comment | added | CalculatorFeline | In fact, this! (-8 bytes due to optimized algorithm, +9 bytes to add output) | |
| Feb 28, 2017 at 17:37 | comment | added | Adám | Would it be possible to include a TIO link? | |
| Feb 28, 2017 at 17:34 | history | edited | Trelzevir | CC BY-SA 3.0 |
added 46 characters in body
|
| Feb 28, 2017 at 17:31 | comment | added | CalculatorFeline |
~-n==(n-1).
|
|
| Feb 28, 2017 at 17:31 | history | edited | Trelzevir | CC BY-SA 3.0 |
added 42 characters in body
|
| Feb 28, 2017 at 17:14 | history | answered | Trelzevir | CC BY-SA 3.0 |