| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 39219 | Brenden Politeness Filter | 1 | 46 |
|
|
| 28609 | Boat Burglary | 15 | 147 |
|
|
| 41374 | Digit Shifts | 12 |
|
||
| 31894 | House Buying Optimizations | 6 |
|
||
| 7947 | Almost square factorisation | 5 | 120 |
|
|
| 40512 | Kevin likes array | 1 | 46 |
|
|
| 1865 | Making Waves | 185 |
|
||
| 3935 | SHIFT Operator on Matrix | 189 |
|
||
| 34567 | Least prime divisor | 5 | 230 |
|
|
| 5142 | A Pair of Graphs | 1 | 68 |
|
|
| 34617 | Palindrome Lover | 2 | 176 |
|
|
| 1707 | Reliable Nets | 4 | 339 |
|
|
| 1713 | Funny scales | 12 | 560 |
|
|
| 120 | Solitaire | 7 | 359 |
|
|
| 5317 | Tetravex Puzzle | 2 | 280 |
|
#brute-force
Brute-force search (exhaustive search, generate and test) is a problem-solving technique that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem's statement
https://en.wikipedia.org/wiki/Brute-force_search https://en.wikipedia.org/wiki/Brute-force_attack
RSS