Complexity of a Back-tracking solution

Правка en1, от aka.Sohieb, 2016-07-27 00:34:33

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. Язык Кто Когда Δ Комментарий
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)