Timeline for Turn an integer n into a list containing it n times
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 22, 2017 at 20:39 | comment | added | ceilingcat | Suggest *f(k){int r[k], instead of int*f(k){int*r=malloc(k*4), | |
| Aug 21, 2017 at 15:45 | comment | added | Jasmes | You can save 2 bytes by removing a comparison to 0 in for cycle, unless I've overlooked something. | |
| Aug 21, 2017 at 12:22 | comment | added | aschepler | Yay "long arrow operator". Also, I didn't think gcc would ever use register eax for locals. Go figure. | |
| Aug 21, 2017 at 11:19 | history | answered | Conor O'Brien | CC BY-SA 3.0 |