Timeline for Am I a Fibonacci Number?
Current License: CC BY-SA 4.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 15, 2020 at 7:34 | history | edited | Olivier Grégoire | CC BY-SA 4.0 |
added 24 characters in body
|
| May 14, 2020 at 16:29 | comment | added | Kevin Cruijssen |
37 bytes by taking input as unary and porting the Retina approach: s->s.matches(".?|(\\2?+(\\1|^.))*..") (Here an explanation of that regex.)
|
|
| Jun 16, 2017 at 8:37 | history | edited | Olivier Grégoire | CC BY-SA 3.0 |
added 89 characters in body
|
| Jun 16, 2017 at 8:20 | history | edited | Olivier Grégoire | CC BY-SA 3.0 |
Given the impressive saves, I thought it'd be better to show the full history as well.
|
| Jun 16, 2017 at 8:01 | history | edited | Olivier Grégoire | CC BY-SA 3.0 |
added 56 characters in body
|
| Jun 16, 2017 at 7:40 | comment | added | Olivier Grégoire | You're doing black magic, @DavidConrad! I'm telling you! Black magic! :) | |
| Jun 16, 2017 at 7:40 | history | edited | Olivier Grégoire | CC BY-SA 3.0 |
added 53 characters in body
|
| Jun 16, 2017 at 7:31 | comment | added | David Conrad |
You don't need a temp variable for the Fibonacci sequence. You can calculate successive pairs with b+=a;a=b-a;
|
|
| Jun 15, 2017 at 12:05 | history | edited | Olivier Grégoire | CC BY-SA 3.0 |
deleted 32 characters in body
|
| Jun 15, 2017 at 11:59 | history | edited | Olivier Grégoire | CC BY-SA 3.0 |
added 88 characters in body
|
| Jun 15, 2017 at 11:23 | history | edited | Olivier Grégoire | CC BY-SA 3.0 |
added 77 characters in body
|
| Jun 15, 2017 at 11:12 | comment | added | Olivier Grégoire | @KevinCruijssen I golfed not 1, but 5 bytes with that clause! :-P Thanks, I hadn't noticed it. | |
| Jun 15, 2017 at 11:04 | history | edited | Olivier Grégoire | CC BY-SA 3.0 |
added 34 characters in body
|
| Jun 15, 2017 at 10:45 | comment | added | Kevin Cruijssen |
Nice approach. Btw, you can golf a byte by changing n==0 to n<1. In the question it states "A non-negative integer between 0 and 1,000,000,000".
|
|
| Jun 15, 2017 at 10:38 | history | edited | Olivier Grégoire | CC BY-SA 3.0 |
Added a test-case in the TIO
|
| Jun 15, 2017 at 10:30 | history | edited | Olivier Grégoire | CC BY-SA 3.0 |
added 87 characters in body
|
| Jun 15, 2017 at 9:45 | history | answered | Olivier Grégoire | CC BY-SA 3.0 |