Timeline for Predict where the man will go
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Apr 13, 2017 at 12:39 | history | edited | CommunityBot |
replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/
|
|
| Apr 5, 2014 at 5:53 | history | edited | user2357112 | CC BY-SA 3.0 |
added 478 characters in body
|
| Apr 4, 2014 at 23:09 | comment | added | user2357112 | @RobertoBonvallet: Yup. Advice implemented. | |
| Apr 4, 2014 at 23:09 | history | edited | user2357112 | CC BY-SA 3.0 |
Applied Roberto's advice
|
| Apr 4, 2014 at 20:56 | comment | added | Roberto Bonvallet |
If you allow r to take a parameter (r = lambda x: ...), then you can shorten g=[r()for i in x] to g=map(r,x).
|
|
| Apr 4, 2014 at 17:39 | history | edited | ProgramFOX | CC BY-SA 3.0 |
Added syntax highlighting
|
| Apr 4, 2014 at 14:35 | history | edited | user2357112 | CC BY-SA 3.0 |
deleted 19 characters in body
|
| Apr 4, 2014 at 14:18 | comment | added | user2357112 | @Howard: Thanks. Edits applied. | |
| Apr 4, 2014 at 14:13 | history | edited | user2357112 | CC BY-SA 3.0 |
Applied Howard's advice
|
| Apr 4, 2014 at 14:09 | comment | added | Howard |
You can shorten the not to 1^ and the long if condition can be written f=g[i][j]^v[i][j]&1 j+=f i+=1^f.
|
|
| Apr 4, 2014 at 13:52 | history | edited | user2357112 | CC BY-SA 3.0 |
deleted 2 characters in body
|
| Apr 4, 2014 at 13:31 | history | edited | user2357112 | CC BY-SA 3.0 |
deleted 4 characters in body
|
| Apr 4, 2014 at 13:26 | history | edited | user2357112 | CC BY-SA 3.0 |
Added golf
|
| Apr 4, 2014 at 13:20 | history | edited | user2357112 | CC BY-SA 3.0 |
Added golf
|
| Apr 4, 2014 at 13:00 | history | answered | user2357112 | CC BY-SA 3.0 |