| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 4 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
Complexity of a Back-tracking solution
I was trying to solve this problem 27E - Number With The Given Amount Of Divisors, it 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) |
