Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
< 1 2 3 ... 100 101 102Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 255 | Managing Cluster | dp graphs math trees | Statement | M | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 83 | Legacy Screensaver | Statement | L | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | ||||
| 68 | Knowns and Unknowns | Statement | K | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | ||||
| 854 | Judicious Watching | binary search greedy | Statement | J | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 80 | Incompetent Delivery Guy | graphs shortest paths | Statement | I | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 33 | Hunting Hoglins in Hogwarts | interactive | Statement | H | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 124 | Geometric Balance | Statement | G | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | ||||
| 1690 | Fix Flooded Floor | constructive algorithms dp | Statement | F | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 908 | Expression Correction | Statement | E | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | ||||
| 652 | DAG Serialization | brute force graphs | Statement | D | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 21 | Cactus without Bridges | constructive algorithms math | Statement | C | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | |||
| 298 | BitBitJump | Statement | B | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | ||||
| 2030 | Adrenaline Rush | Statement | A | 2024-2025 ICPC, NERC, Northern Eurasia Finals (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2052} | PROGRAMMING | ||||
| 18088 | Tender Carpenter | dp geometry implementation math | Statement | A | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 500.0 | ||
| 3264 | Resourceful Caterpillar Sequence | dfs and similar dp games graphs implementation trees | Statement | E | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2000.0 | ||
| 5829 | Refined Product Optimality | binary search data structures greedy implementation math schedules sortings | Statement | D | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 1750.0 | ||
| 13001 | Outstanding Impressionist | binary search brute force greedy | Statement | B | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 1000.0 | ||
| 139 | Naive String Splits | brute force greedy hashing strings | Statement | G | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 4250.0 | ||
| 707 | Earnest Matrix Complement | data structures dp greedy implementation | Statement | F | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2500.0 | ||
| 39 | Delicate Anti-monotonous Operations | constructive algorithms implementation | Statement | H | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 4500.0 | ||
| 9074 | Bewitching Stargazer | bitmasks divide and conquer dp math | Statement | C | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 1250.0 | ||
| 32 | Affectionate Arrays (Hard Version) | data structures dp graphs greedy math shortest paths two pointers | Statement | I2 | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 2000.0 | ||
| 345 | Affectionate Arrays (Easy Version) | dp greedy | Statement | I1 | Good Bye 2024: 2025 is NEAR {2053} | PROGRAMMING | 3000.0 | ||
| 25848 | Two Frogs | constructive algorithms games greedy | Statement | A | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 500.0 | ||
| 11897 | The Trail | constructive algorithms greedy math | Statement | C | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 1500.0 | ||
| 2838 | Scarecrow | binary search greedy | Statement | D | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 2250.0 | ||
| 195 | Haystacks | constructive algorithms data structures greedy | Statement | E | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 3000.0 | ||
| 20116 | Crafting | greedy sortings | Statement | B | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 1000.0 | ||
| 35 | Cosmic Divide | brute force geometry hashing math strings | Statement | F | Codeforces Round 996 (Div. 2) {2055} | PROGRAMMING | 3500.0 | ||
| 9886 | Trip to the Olympiad | bitmasks constructive algorithms greedy math | Statement | C | Hello 2025 {2057} | PROGRAMMING | 1500.0 | ||
| 408 | Secret Message | constructive algorithms math | Statement | G | Hello 2025 {2057} | PROGRAMMING | 3750.0 | ||
| 22381 | MEX Table | constructive algorithms greedy | Statement | A | Hello 2025 {2057} | PROGRAMMING | 500.0 | ||
| 17102 | Gorilla and the Exam | greedy sortings | Statement | B | Hello 2025 {2057} | PROGRAMMING | 1000.0 | ||
| 3770 | Gifts Order | data structures greedy math | Statement | D | Hello 2025 {2057} | PROGRAMMING | 2250.0 | ||
| 162 | Formation | dp sortings | Statement | F | Hello 2025 {2057} | PROGRAMMING | 3500.0 | ||
| 103 | Coffee Break | data structures greedy greedy math | Statement | H | Hello 2025 {2057} | PROGRAMMING | 4500.0 | ||
| 1206 | Another Exercise on Graphs (hard version) | binary search brute force ds graphs shortest paths sortings trees | Statement | E2 | Hello 2025 {2057} | PROGRAMMING | 2000.0 | ||
| 1749 | Another Exercise on Graphs (Easy Version) | binary search brute force dp graphs shortest paths | Statement | E1 | Hello 2025 {2057} | PROGRAMMING | 1000.0 |