List combinations in Haskell with booleans

后端 未结 0 1133
梦毁少年i
梦毁少年i 2021-02-20 01:36

So, I recently started learning Haskell and I came across a question where I need to calculate all possible outcomes(2^n) if n number of coins are flipped. For example, if 2 coi

相关标签:
回答
  • 消灭零回复
提交回复
热议问题