Nu aveti permisiuni pentru a descarca fisierul grader_test17.in
Diferente pentru blog/numbers-everyone-should-know intre reviziile #14 si #15
Nu exista diferente intre titluri.
Diferente intre continut:
The table below shows the limits that can be reached in a few seconds by algorithms of different complexities. n is the size of the input. I've added a few algorithms and data structure examples for respective complexity classes.
|_.sizeofn |_. complexity |_. algorithms |_. data structures|
|_. maximum n |_. complexity |_. algorithms |_. data structures|
| 8 | n^n^ | brute force, cartesian product | | | 9-10 | n! | brute force, backtracking, next_permutation | | | 13-17 | 3^n^ | dynamic programming with exponential states | hash_map (to store the states) |
