Timeline for Days in indexed month
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 2, 2019 at 3:06 | comment | added | radeklew | @ceilingcat Nice! Got it down to 40 and updated the answer. Good idea with the subtraction. | |
| Dec 2, 2019 at 3:05 | history | edited | radeklew | CC BY-SA 4.0 |
improved description
|
| Nov 30, 2019 at 4:58 | comment | added | radeklew |
@ceilingcat Great idea! I wouldn't have thought to use /, since I was focussed on bitwise operators.
|
|
| Nov 30, 2019 at 4:57 | history | edited | radeklew | CC BY-SA 4.0 |
added 565 characters in body
|
| Nov 17, 2019 at 19:45 | comment | added | radeklew | @HermanL Thank you, it looks so obvious now that you point that out! I guess I need more practice with bitwise operators. | |
| Nov 17, 2019 at 19:23 | history | edited | radeklew | CC BY-SA 4.0 |
Improved answer
|
| Nov 17, 2019 at 8:13 | comment | added | Endenite |
A few bytes can be saved by reordering the operators: int f(int n){return((n>>3|n>>2|n)&1)+((n^n>>3)&1)+29;}
|
|
| Nov 17, 2019 at 8:08 | comment | added | Endenite | Welcome to CG&CC! | |
| Nov 17, 2019 at 8:04 | history | edited | radeklew | CC BY-SA 4.0 |
added 16 characters in body
|
| Nov 17, 2019 at 7:55 | review | First posts | |||
| Nov 17, 2019 at 8:15 | |||||
| Nov 17, 2019 at 7:51 | history | answered | radeklew | CC BY-SA 4.0 |