Search

BQN, 13 bytes {+´(𝕨⋆↕≠𝕩)×𝕩} { } # fn +´ # sum reduce (𝕨⋆↕≠𝕩) # x^i for each term ×𝕩 # times each coefficient Try it

posted 3y ago by snail_‭  ·  edited 3y ago by snail_‭

APL (Dyalog Unicode), 15 bytesSBCS With many thanks to Marshall Lochbaum and dzaima for their help debugging and golfing this answer {⍵∪⌊⍵*2|⍵+.5}⍣≡ {⍵∪⌊⍵*2|⍵+.5}⍣≡ ⍝ ⍵ is our input of eith...

posted 3y ago by SherlockSage‭

BQN, 107 bytes A↩C←A⇐¯π{_𝕣_:@;/⊏𝕩.y?𝕗‿∊𝕊⟨𝕤,⍷⟩𝕏𝕎𝔽𝕨𝔾𝕘}∞˙⌜˘¨´˝`(•Js⎉⊔⎊⌽⌾⍉⚇«∘»·∧○∨⍋⍒↑↓≍∾˜⥊⋈↕⊢⍟⊣¬!|≡≢/≥⟜≠=⊸≥⊐⊘⊒◶⊑><⌊⌈√⁼⋆+-×÷)⋄# BQN doesn't have keywords but primitive symbols are reserved. It's ...

posted 2y ago by Razetime‭  ·  edited 2y ago by Razetime‭

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...

posted 5mo ago by RubenVerg‭  ·  edited 5mo ago by RubenVerg‭

APL (Dyalog Unicode), 31 bytes ⎕←↑(14↑(2⌷x),⍨⌽)¨,\1⌷x←⍉13 2⍴⎕A Try it online! Lot worse than the BQN answer. ⎕←↑(14↑(2⌷x),⍨⌽)¨,\1⌷x←⍉13 2⍴⎕A ⎕A ⍝ String of up...

posted 3y ago by user‭