Timeline for Check whether an integer is a power of 2 without using +,- operations
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 7, 2017 at 1:12 | review | Late answers | |||
| Apr 7, 2017 at 1:14 | |||||
| Apr 7, 2017 at 1:11 | comment | added | Opportunist | @xnor Thanks. I'm aware that this site usually accepts functions as answers, but I was unsure of the rules on function vs full program because the question states "Use some sort of input stream to get the number" and the other haskell answer does the same. Also, I didn't realize that this question was so old. Is it considered rude to neco old questions here? | |
| Apr 7, 2017 at 1:03 | comment | added | xnor | Welcome to PPCG! Check out our Haskell golfing rules. In particular, just functions are fine, you don't need the last line. (Edit: Actually, this challenge is really old (2014) before functions were default. Maybe stick with the program.) | |
| Apr 7, 2017 at 0:56 | history | answered | Opportunist | CC BY-SA 3.0 |