Probleme
Chess on a Torus#3720
Foarte dificil · Graphs · Breadth-first Search · Shortest paths
Nim Withoff#3721
Ușor · Games
Variation of NIM#3722
Ușor · Games
Fermat's Little Theorem#3723
Dificil · Number theory
Cut a graph#3728
Foarte ușor · Graphs
The Cost of a Walk#3730
Ușor · Graphs · Graph network flows
Trust#3731
Dificil · Binary Search · Graph network flows
Striking slipper#3732
Foarte ușor · Math
Least Common Multiple#3733
Foarte ușor · Number theory · Math
Zeros in the product#3734
Mediu · Number theory · Math · Prime factorization
Golden sand#3736
Mediu · Knapsack · Greedy algorithms
Is it a Heap?#3737
Foarte ușor · Implementation
Simple Sorting#3738
Foarte ușor · Sorting
Mutants-2#3739
Mediu · Dynamic programming
Again About Horses#3740
Ușor · Graphs
Subarray with maximum XOR#3741
Foarte ușor · Bitmasks
n^n mod 10^p#3742
Mediu · Math
Mean Median Problem#3743
Ușor · Math
Factorial Again!#3744
Foarte ușor · Implementation
Ants Colony#3745
Foarte ușor · Graphs · Shortest paths
Bingo!#3746
Ușor · Brute force
Cocircular Points#3747
Foarte ușor · Geometry · Brute force
Digits Count#3748
Foarte ușor · Math
Electric Needs#3749
Ușor · Binary Search · Implementation
Flowers Flourish from France#3750
Foarte ușor · Strings