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']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 6858 | Queue | binary search data structures | Statement | B | Codeforces Beta Round 75 (Div. 1 Only) {91} | PROGRAMMING | Analysis Codeforces Beta Round #75 | 1600 | |
| 143 | Soap Time! - 2 | binary search data structures | Statement | E | Codeforces Round 118 (Div. 1) {185} | PROGRAMMING | 2900 | ||
| 5269 | Little Elephant and Cards | binary search data structures | Statement | B | Codeforces Round 129 (Div. 1) {204} | PROGRAMMING | Tutorial | 1600 | |
| 475 | Fence | binary search data structures string suffix structures | Statement | D | Codeforces Round 144 (Div. 1) {232} | PROGRAMMING | 2700 | ||
| 457 | Dividing Kingdom | binary search brute force data structures | Statement | E | Codeforces Round 158 (Div. 2) {260} | PROGRAMMING | 2600 | ||
| 2476 | Sereja ans Anagrams | binary search data structures | Statement | B | Codeforces Round 215 (Div. 1) {367} | PROGRAMMING | Codeforces Round #215 — tutorial | 2000 | |
| 2178 | Valera and Queries | binary search data structures | Statement | E | Codeforces Round 216 (Div. 2) {369} | PROGRAMMING | Editorial Codeforces Round #216 (Div. 2) | 2400 | |
| 890 | George and Cards | binary search data structures | Statement | E | Codeforces Round 227 (Div. 2) {387} | PROGRAMMING | 2500 | ||
| 972 | Inna and Binary Logic | binary search bitmasks data structures | Statement | E | Codeforces Round 234 (Div. 2) {400} | PROGRAMMING | Codeforces Round #234 (Div. 2) — Tutorial | 2400 | |
| 2344 | Sign on Fence | binary search constructive algorithms data structures | Statement | E | Codeforces Round 276 (Div. 1) {484} | PROGRAMMING | 2700 | ||
| 1240 | Painting Edges | binary search data structures | Statement | E | Codeforces Round 319 (Div. 1) {576} | PROGRAMMING | 3200 | ||
| 3486 | Friends and Subsequences | binary search data structures | Statement | D | Codeforces Round 361 (Div. 2) {689} | PROGRAMMING | Tutorial | 2200 | |
| 1157 | Animals and Puzzle | binary search data structures | Statement | D | Codeforces Round 371 (Div. 1) {713} | PROGRAMMING | 2700 | ||
| 2572 | Leaving Auction | binary search data structures | Statement | D | Codeforces Round 388 (Div. 2) {749} | PROGRAMMING | 2000 | ||
| 1412 | Radio stations | binary search data structures | Statement | E | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 2400 | |
| 363 | The Winds of Winter | binary search data structures | Statement | G | Divide by Zero 2017 and Codeforces Round 399 (Div. 1 + Div. 2, combined) {768} | PROGRAMMING | Editorial Divide by Zero and Codeforces Round #399 (Div. 1+2, combined) | 3000 | |
| 2447 | Army Creation | binary search data structures | Statement | E | Educational Codeforces Round 22 {813} | PROGRAMMING | 52410 | 2300 | |
| 3699 | Vitya and Strange Lesson | binary search data structures | Statement | D | Codeforces Round 430 (Div. 2) {842} | PROGRAMMING | Tutorial Codeforces Round #430 (Div. 2) | 2100 | |
| 601 | Fire in the City | binary search data structures | Statement | E | Educational Codeforces Round 27 {845} | PROGRAMMING | 2500 | ||
| 2532 | Monitor | binary search data structures | Statement | D | Educational Codeforces Round 28 {846} | PROGRAMMING | 54357 | 1900 | |
| 5052 | Preparing for Merge Sort | binary search data structures | Statement | B | 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred) {847} | PROGRAMMING | 1700 | ||
| 459 | Nagini | binary search data structures | Statement | F | Manthan, Codefest 17 {855} | PROGRAMMING | 3000 | ||
| 7334 | Producing Snow | binary search data structures | Statement | B | VK Cup 2018 - Round 1 {923} | PROGRAMMING | 1600 | ||
| 1451 | Nastya and King-Shamans | binary search data structures | Statement | E | Codeforces Round 489 (Div. 2) {992} | PROGRAMMING | 2600 | ||
| 1388 | Getting Deals Done | binary search data structures | Statement | E | 2018-2019 ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) {1070} | PROGRAMMING | Solution to problem M. Algoland and Berland of 2018-2019 ICPC, NEERC | 2300 | |
| 1085 | Nastya Hasn't Written a Legend | binary search data structures | Statement | E | Codeforces Round 546 (Div. 2) {1136} | PROGRAMMING | Editorial of Round #546(Div.2) | 2500 | |
| 719 | Gardener Alex | binary search data structures | Statement | F | Codeforces Round 586 (Div. 1 + Div. 2) {1220} | PROGRAMMING | Codeforces Round #586 Editorial | 2600 | |
| 1758 | K Integers | binary search data structures | Statement | C | Codeforces Round 609 (Div. 1) {1268} | PROGRAMMING | Codeforces Round #609 — Editorial | 2300 | |
| 8880 | Multiset | binary search data structures | Statement | D | Educational Codeforces Round 87 (Rated for Div. 2) {1354} | PROGRAMMING | 77593 | 1900 |