| # | User | Rating |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | pajenegod | 145 |
| 9 | SecondThread | 145 |
Recursive function time complexity
I can't find the time complexity of the following program. Even I can't find a way to calculate its complexity with master theorem. Please help me about how to calculate it. Thanks
My submission : https://codeforces.com/contest/128/submission/114386842
Problem link : https://codeforces.com/contest/128/problem/B
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
ThoughtNerd | 2021-04-27 20:30:49 | 19 | Tiny change: 'an't find its compl' -> 'an't find a way to calculate its compl' | |
| en1 |
|
ThoughtNerd | 2021-04-27 20:29:42 | 333 | Initial revision (published) |
