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
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3843 |
| 2 | jiangly | 3705 |
| 3 | Benq | 3628 |
| 4 | orzdevinwang | 3571 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3530 |
| 8 | ecnerwala | 3499 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 163 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 158 |
| 5 | nor | 153 |
| 5 | maroonrk | 153 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 9 | orz | 145 |
| 10 | pajenegod | 144 |
→ Find user
→ Recent actions
Best way to write 3^n without recursion like 2^n bitmask is there a way?
Revision en1, by BrynzaMasterZa228, 2022-11-13 19:09:53
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| 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) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jun/16/2024 12:10:14 (h1).
Desktop version, switch to mobile version.
Supported by
