| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 9493 | Advanced Fruits | 91 | 2114 |
|
|
| 19301 | Operators (new ver) | 1 | 31 |
|
|
| 28587 | A problem of Backtracking | 5 | 414 |
|
|
| 27182 | Easy modified sudoku | 4 | 251 |
|
|
| 35337 | Faketorial Hashing | 1 | 1 |
|
|
| 17406 | Cheating a Boolean Tree | 5 | 84 |
|
|
| 31894 | House Buying Optimizations | 4 |
|
||
| 36936 | K-Divisors | 2 | 2 |
|
|
| 1538 | Making Jumps | 10 | 1300 |
|
|
| 15609 | Spiky Mazes | 21 | 675 |
|
|
| 34973 | Yet Another Subset Sum Problem | 1 | 2 |
|
|
| 4525 | Digger Octaves | 6 | 320 |
|
|
| 224 | Vonny and her dominos | 4 | 599 |
|
#backtracking
Backtracking is a general algorithm for finding all (or some) solutions to a computational problem that incrementally builds candidates to the solutions, and abandons (backtracks) each partial candidate as soon as it is able to determine that it cannot be completed to a valid solution
https://en.wikipedia.org/wiki/Backtracking http://web.cse.ohio-state.edu/~gurari/course/cis680/cis680Ch19.html - backtracking algorithms http://www.geeksforgeeks.org/tag/backtracking/
RSS