| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Complexity of a Back-tracking solution
I was trying to solve this problem 27E - Number With The Given Amount Of Divisors, it was said in the editorials that this is a dynamic programming problem,
but i tried to solve it using only back tracking with pruning and i got AC 19429925.
could anyone tell what is the complexity of this solution?! or how to measure the complexity of bt solutions in general?!
thanks in advance :)
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
aka.Sohieb | 2016-07-27 00:48:37 | 4 | Tiny change: ':27E], it said in t' -> ':27E], it was said in t' | |
| en2 |
|
aka.Sohieb | 2016-07-27 00:35:14 | 0 | (published) | |
| en1 |
|
aka.Sohieb | 2016-07-27 00:34:33 | 407 | Initial revision (saved to drafts) |
