Problemat

Miracle Tree#2433

E lehtë · Brute force

Necklace#2434

E lehtë · Combinatorics

Abelian Groups#2435

Shumë e vështirë · Number theory

Necklace 2#2436

Shumë e vështirë · Combinatorics · Number theory · Math

Minimum sum of digits#2437

E vështirë · Dynamic programming

Equations in Permutations#2438

E lehtë · Combinatorics · Dynamic programming

Boolean Extremes#2439

Shumë e vështirë · Bitwise Operations

n-th Largest Value#2440

Shumë e lehtë · Sorting · Implementation

Equal Sum Partitions#2441

Mesatare · Number theory · Greedy algorithms · Prime factorization

Balls#2442

E vështirë · Binary Search · Combinatorics · Dynamic programming

Running Median#2443

Shumë e lehtë · Priority Queue

Game of Chips#2444

Shumë e lehtë · Brute force

Adjacent Bit Counts#2445

Mesatare · Dynamic programming

Convex Hull of Lattice Points#2446

Shumë e lehtë · Geometry

Interior Points of Lattice Polygons#2447

Shumë e lehtë · Geometry

Theta Puzzle#2448

Mesatare · Breadth-first Search · Graphs

Fair Division#2449

E vështirë · Greedy algorithms · Sorting

Free Goodies#2450

Shumë e lehtë · Greedy algorithms · Dynamic programming

High Score#2451

Shumë e lehtë · Dynamic programming · Strings

Hill Driving#2452

Mesatare · Math · Binary Search · Greedy algorithms

Rankings#2453

Mesatare · Graphs · Breadth-first Search · Sorting

Risk#2454

Shumë e lehtë · Binary Search · Graphs · Graph network flows

Selling Land#2455

E vështirë · Stacks · Dynamic programming · Greedy algorithms · Sorting

Stock Prices#2456

Shumë e lehtë · Priority Queue · Implementation

Telephone Network#2457

Shumë e vështirë · Graphs · Disjoint set union

2351-2375 nga 9226