Новые задачи | Задачи к Contester доступны в виде встраиваемых zip-файлов. Подробней »
Вы также можете внести новые задачи самостоятельно. Подробней »
|
|
Задачи упорядочены по: [префиксу] (сложности)
Страницы: (1) (2) (3) (4) [5] (6) (7) (8) ... (10) ... (20) ... (29)
| Название задачи | | Вкратце | Форум |
| Sum until 0 |
 |
|
|
| Sum less than N |
|
|
|
| Sum of N numbers |
|
|
|
| The N Queens Problem |
|
Backtracking, Recursion |
|
| Subsets |
|
Backtracking, Recursion |
|
| Maximum Sum 2 |
|
backtracking, recursion |
|
| Gifts of Santa Claus |
|
backtracking, recursion |
|
| Rectangles on a plane |
|
Geometry, Inclusion–exclusion principle |
|
| Permutations (-) |
|
Combinatorics |
|
| Reverse permutation |
|
Combinatorics |
|
| Nameplates |
|
Graphs |
|
| Adjacency matrix to edges list |
|
Graphs |
|
| Edges list to Adjacency matrix |
|
Graphs |
|
| Cities and roads |
|
Graphs |
|
| Cycle detection |
|
Graphs |
Обсуждение (1) » |
| Diameter of graph |
|
Graphs, Floyd–Warshall algorithm |
|
| Divisors count |
|
Number theory |
|
| GCD of ones |
|
Number theory, GCD |
|
| Prime numbers |
|
Number theory, Sieve of Eratosthenes |
|
| Set cover problem |
|
Dynamic programming |
|
| Shopping |
|
Dynamic programming, knapsack |
|
| Corridor |
|
Dynamic programming, Combinatorics |
|
| D. Love-Hate |
|
|
|
| Ferris Wheel |
|
|
|
Страницы: (1) (2) (3) (4) [5] (6) (7) (8) ... (10) ... (20) ... (29)
|