Best way to write 3^n without recursion like 2^n bitmask is there a way?

Правка en1, от BrynzaMasterZa228, 2022-11-13 19:09:53

I just solved a problem that need 3^n recursion 0,1,2 0=not choose, 1=choose one way, 2=choose 2nd way like this, and its messy cause we need the path we took also it itself doesnt seem nice, can you guys please write your ways of writing

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский BrynzaMasterZa228 2022-11-13 19:16:38 56 Tiny change: 'f writing ' -> 'f writing .\n\nsorry i will reply hours late cause i will sleep rn'
en1 Английский BrynzaMasterZa228 2022-11-13 19:09:53 313 Initial revision (published)