Timeline for Dancing arrays. Output them with some forward-backward moves
Current License: CC BY-SA 3.0
30 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 23, 2017 at 21:45 | answer | added | R. Kap | timeline score: 0 | |
| Mar 22, 2017 at 10:18 | comment | added | Matthew Roh | "Be positive while dancing" Nice play on words! | |
| Mar 22, 2017 at 9:32 | answer | added | G B | timeline score: 0 | |
| Mar 22, 2017 at 9:03 | comment | added | fergusq | Is it ok to print trailing newlines? | |
| Mar 22, 2017 at 6:03 | answer | added | Not a tree | timeline score: 0 | |
| Mar 21, 2017 at 14:12 | answer | added | Magic Octopus Urn | timeline score: 0 | |
| Mar 21, 2017 at 0:06 | comment | added | Not a tree | Can we assume the entries in the array are all distinct? | |
| Mar 20, 2017 at 14:19 | comment | added | Dead Possum | @RomanBruhanov Request to print array once if F >= len(array) would just add F=min(F,len(array)) to every code. Nothing very interesting | |
| Mar 20, 2017 at 14:01 | answer | added | Dead Possum | timeline score: 0 | |
| Mar 20, 2017 at 13:37 | answer | added | fəˈnɛtɪk | timeline score: 1 | |
| Mar 20, 2017 at 12:57 | comment | added | hyperneutrino♦ | Nice first post here! For future challenges, I would recommend posting them in the Sandbox first so you can get suggestions and improve your challenge before posting! | |
| Mar 20, 2017 at 12:46 | answer | added | hyperneutrino♦ | timeline score: 1 | |
| Mar 20, 2017 at 12:44 | history | edited | Roman Bruhanov | CC BY-SA 3.0 |
Clarify condition.
|
| Mar 20, 2017 at 12:41 | history | edited | Roman Bruhanov | CC BY-SA 3.0 |
Changed test case.
|
| Mar 20, 2017 at 12:39 | comment | added | Roman Bruhanov | Ok, i think it will be more interesting to print array once, if F if >= len(array). Even if F and B form bad conditions. | |
| Mar 20, 2017 at 12:30 | history | edited | Roman Bruhanov | CC BY-SA 3.0 |
Added more test cases.
|
| Mar 20, 2017 at 12:27 | comment | added | Roman Bruhanov | @HyperNeutrino There is no guarantee of F. in case of F >= len(array), If there is no endless or backward-movement break conditions, program should output one iteration (which will be whole array) and exit. "Run till the end of array" | |
| Mar 20, 2017 at 12:23 | comment | added | Roman Bruhanov | @HyperNeutrino Yes, input can be [array],F,B. | |
| Mar 20, 2017 at 12:21 | history | edited | Roman Bruhanov | CC BY-SA 3.0 |
Fixed test case.
|
| Mar 20, 2017 at 12:21 | comment | added | hyperneutrino♦ |
Are we guaranteed that F < len(array)?
|
|
| Mar 20, 2017 at 12:17 | comment | added | hyperneutrino♦ |
Can I take input as [array],F,B?
|
|
| Mar 20, 2017 at 12:16 | history | edited | Roman Bruhanov | CC BY-SA 3.0 |
Fixed test case.
|
| Mar 20, 2017 at 12:10 | review | Close votes | |||
| Mar 20, 2017 at 13:23 | |||||
| Mar 20, 2017 at 12:09 | history | edited | Roman Bruhanov | CC BY-SA 3.0 |
Added test cases. Added missing dot in title sentence.
|
| Mar 20, 2017 at 11:48 | comment | added | Luis Mendo | Consider allowing more flexible output, such as each subarray on a line without the blank lines, or an array of subarrays | |
| Mar 20, 2017 at 11:38 | comment | added | Matthew Roh | So.. It's like the snail climbing to escape the well, reads the number each time it moves? | |
| Mar 20, 2017 at 11:35 | comment | added | Okx | Can we get more test cases? | |
| Mar 20, 2017 at 11:31 | history | edited | Okx |
add tag
|
|
| Mar 20, 2017 at 11:21 | review | First posts | |||
| Mar 20, 2017 at 11:50 | |||||
| Mar 20, 2017 at 11:18 | history | asked | Roman Bruhanov | CC BY-SA 3.0 |