Post History
BQN, 37 bytes ⍉∘⌽∘∾˜´(⍉{1⊸⌈⊸⋈⊑+`∘⌽⍟𝕩↕2}⥊'@'⊸+)¨∘⌽∘↕ -3 thanks to dzaima The output isn't the same as the example but I think it's still correct if I understand the challenge correctly. Result...
Answer
#2: Post edited
# BQN, 40 bytes- ```bqn
{⍉∘⌽∘∾˜´⌽(⋈⟜(1⊸⌈)∘{⊑+`∘⌽⍟𝕩↕2}⥊'@'⊸+)¨↕𝕩}- ```
- The output isn't the same as the example but I think it's still correct if I understand the challenge correctly.
- Result for x = 7:
- ```
- FFFFFFFFEEEEE
- FFFFFFFFEEEEE
- FFFFFFFFEEEEE
- FFFFFFFFEEEEE
- FFFFFFFFEEEEE
- FFFFFFFFBADDD
- FFFFFFFFCCDDD
- FFFFFFFFCCDDD
```## Explanation* `¨↕𝕩` for each number in [0, x)* `⥊'@'⊸+` reshape the letter with that index* `⋈⟜(1⊸⌈)∘{⊑+`∘⌽⍟𝕩↕2}` to the shape of a pair formed by repeating the Fibonacci number at that index twice, making sure that the right element of the pair is at least 1* `˜´⌽` left-reduce* `⍉∘⌽∘∾` by concatenating and then rotating
- # BQN, 37 bytes
- ```bqn
- ⍉∘⌽∘∾˜´(⍉{1⊸⌈⊸⋈⊑+`∘⌽⍟𝕩↕2}⥊'@'⊸+)¨∘⌽∘↕
- ```
- -3 thanks to dzaima
- The output isn't the same as the example but I think it's still correct if I understand the challenge correctly.
- Result for x = 7:
- ```
- FFFFFFFFEEEEE
- FFFFFFFFEEEEE
- FFFFFFFFEEEEE
- FFFFFFFFEEEEE
- FFFFFFFFEEEEE
- FFFFFFFFBADDD
- FFFFFFFFCCDDD
- FFFFFFFFCCDDD
- ```
#1: Initial revision
# BQN, 40 bytes ```bqn {⍉∘⌽∘∾˜´⌽(⋈⟜(1⊸⌈)∘{⊑+`∘⌽⍟𝕩↕2}⥊'@'⊸+)¨↕𝕩} ``` The output isn't the same as the example but I think it's still correct if I understand the challenge correctly. Result for x = 7: ``` FFFFFFFFEEEEE FFFFFFFFEEEEE FFFFFFFFEEEEE FFFFFFFFEEEEE FFFFFFFFEEEEE FFFFFFFFBADDD FFFFFFFFCCDDD FFFFFFFFCCDDD ``` ## Explanation * `¨↕𝕩` for each number in [0, x) * `⥊'@'⊸+` reshape the letter with that index * `⋈⟜(1⊸⌈)∘{⊑+`∘⌽⍟𝕩↕2}` to the shape of a pair formed by repeating the Fibonacci number at that index twice, making sure that the right element of the pair is at least 1 * `˜´⌽` left-reduce * `⍉∘⌽∘∾` by concatenating and then rotating