Activity for ok12d
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #291049 | Initial revision | — | 10 months ago |
| Answer | — |
A: Word suggesting [Charcoal], 88 bytes ≔⪪η λＦＬθ«¿¬⁼θ⁰«≔…θ⁺ι¹π¿№λπ«≔πω§≔λ⌕λω⁰»«¿Σ⭆λ⁼…κ⁺ι¹π«≔§Φλ⁼…κ⁺ι¹π⁰ω§≔λ⌕λω⁰»«θ≔⁰θ»»»»¿¬⁼θ⁰«ω Try it online! (more) |
— | 10 months ago |
| Edit | Post #290979 |
Post edited: fix |
— | 10 months ago |
| Edit | Post #290979 | Initial revision | — | 10 months ago |
| Answer | — |
A: Fibonacci without consecutive digits [Python 3], 149 bytes g=lambda r:r>1and g(r-1)+g(r-2)or r lambda n:[i for(i)in map(g,range(2n+2))if(lambdal:all(abs(n-i)!=1for(n,i)in zip(l,l[1:])))(map(int,str(i)))][n] Try it online! Based on @isaacg's idea of mapping to twice the input, I had a similar thought, but I wasn't su... (more) |
— | 10 months ago |