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 ... 24 25 26 27 28 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
---|---|---|---|---|---|---|---|---|---|
8296 | Rebranding | implementation strings | Statement | B | Codeforces Round 327 (Div. 2) {591} | PROGRAMMING | Editorial | 1200 | |
14715 | Wizards' Duel | implementation math | Statement | A | Codeforces Round 327 (Div. 2) {591} | PROGRAMMING | 900 | ||
8654 | The Monster and the Squirrel | math | Statement | B | Codeforces Round 328 (Div. 2) {592} | PROGRAMMING | Codeforces Round #328 Problem Analysis | 1200 | |
6377 | PawnChess | implementation | Statement | A | Codeforces Round 328 (Div. 2) {592} | PROGRAMMING | 1300 | ||
3090 | The Big Race | math | Statement | C | Codeforces Round 328 (Div. 2) {592} | PROGRAMMING | 1700 | ||
2669 | Super M | dfs and similar dp graphs trees | Statement | D | Codeforces Round 328 (Div. 2) {592} | PROGRAMMING | 2200 | ||
218 | BCPC | binary search geometry two pointers | Statement | E | Codeforces Round 328 (Div. 2) {592} | PROGRAMMING | 2800 | ||
5833 | 2Char | brute force implementation | Statement | A | Codeforces Round 329 (Div. 2) {593} | PROGRAMMING | Codeforces Round #329 (Editorial) | 1200 | |
4070 | Anton and Lines | geometry sortings | Statement | B | Codeforces Round 329 (Div. 2) {593} | PROGRAMMING | 1600 | ||
1276 | Happy Tree Party | data structures dfs and similar graphs math trees | Statement | D | Codeforces Round 329 (Div. 2) {593} | PROGRAMMING | 2300 | ||
650 | Strange Calculation and Cats | dp matrices | Statement | E | Codeforces Round 329 (Div. 2) {593} | PROGRAMMING | 2600 | ||
287 | Beautiful Function | constructive algorithms math | Statement | C | Codeforces Round 329 (Div. 2) {593} | PROGRAMMING | 2700 | ||
503 | Max and Bike | binary search geometry | Statement | B | Codeforces Round 330 (Div. 1) {594} | PROGRAMMING | 2400 | ||
1683 | REQ | data structures number theory | Statement | D | Codeforces Round 330 (Div. 1) {594} | PROGRAMMING | Codeforces Round #330 (Div.1 + Div.2) Editorial | 2500 | |
694 | Edo and Magnets | brute force greedy implementation two pointers | Statement | C | Codeforces Round 330 (Div. 1) {594} | PROGRAMMING | 2700 | ||
1746 | Warrior and Archer | games | Statement | A | Codeforces Round 330 (Div. 1) {594} | PROGRAMMING | 2900 | ||
166 | Cutting the Line | string suffix structures strings | Statement | E | Codeforces Round 330 (Div. 1) {594} | PROGRAMMING | Codeforces Round #330 (Div.1 + Div.2) Editorial | 3200 | |
2934 | Pasha and Phone | binary search math | Statement | B | Codeforces Round 330 (Div. 2) {595} | PROGRAMMING | 1600 | ||
14692 | Vitaly and Night | constructive algorithms implementation | Statement | A | Codeforces Round 330 (Div. 2) {595} | PROGRAMMING | 700 | ||
7782 | Wilbur and Swimming Pool | geometry implementation | Statement | A | Codeforces Round 331 (Div. 2) {596} | PROGRAMMING | Codeforces Round #331 Editorial | 1200 | |
10437 | Wilbur and Array | greedy implementation | Statement | B | Codeforces Round 331 (Div. 2) {596} | PROGRAMMING | Codeforces Round #331 Editorial | 1200 | |
2262 | Wilbur and Points | combinatorics greedy sortings | Statement | C | Codeforces Round 331 (Div. 2) {596} | PROGRAMMING | 1700 | ||
691 | Wilbur and Trees | dp math probabilities sortings | Statement | D | Codeforces Round 331 (Div. 2) {596} | PROGRAMMING | 2500 | ||
399 | Wilbur and Strings | dfs and similar dp graphs strings | Statement | E | Codeforces Round 331 (Div. 2) {596} | PROGRAMMING | 2900 | ||
4998 | Restaurant | dp greedy sortings | Statement | B | Testing Round 12 {597} | PROGRAMMING | 1600 | ||
4576 | Divisibility | math | Statement | A | Testing Round 12 {597} | PROGRAMMING | 1600 | ||
5269 | Subsequences | data structures dp | Statement | C | Testing Round 12 {597} | PROGRAMMING | 1900 | ||
27325 | Tricky Sum | math | Statement | A | Educational Codeforces Round 1 {598} | PROGRAMMING | Editorial | 1000 | |
11350 | Queries on a String | implementation strings | Statement | B | Educational Codeforces Round 1 {598} | PROGRAMMING | Editorial | 1400 | |
11474 | Igor In the Museum | dfs and similar graphs shortest paths | Statement | D | Educational Codeforces Round 1 {598} | PROGRAMMING | Editorial | 1700 | |
5177 | Chocolate Bar | brute force dp | Statement | E | Educational Codeforces Round 1 {598} | PROGRAMMING | 2000 | ||
4558 | Nearest vectors | geometry sortings | Statement | C | Educational Codeforces Round 1 {598} | PROGRAMMING | Editorial | 2200 | |
386 | Cut Length | geometry | Statement | F | Educational Codeforces Round 1 {598} | PROGRAMMING | Editorial | 2900 | |
4422 | Spongebob and Joke | implementation | Statement | B | Codeforces Round 332 (Div. 2) {599} | PROGRAMMING | 1500 | ||
4688 | Day at the Beach | sortings | Statement | C | Codeforces Round 332 (Div. 2) {599} | PROGRAMMING | Editorial Codeforces Round #332 (Div. 2) | 1600 | |
2602 | Spongebob and Squares | brute force math | Statement | D | Codeforces Round 332 (Div. 2) {599} | PROGRAMMING | Editorial Codeforces Round #332 (Div. 2) | 1800 | |
682 | Sandy and Nuts | bitmasks dp trees | Statement | E | Codeforces Round 332 (Div. 2) {599} | PROGRAMMING | 2100 | ||
29491 | Patrick and Shopping | implementation | Statement | A | Codeforces Round 332 (Div. 2) {599} | PROGRAMMING | Editorial Codeforces Round #332 (Div. 2) | 800 | |
31242 | Queries about less or equal elements | binary search data structures sortings two pointers | Statement | B | Educational Codeforces Round 2 {600} | PROGRAMMING | Editorial | 1300 | |
5379 | Extract Numbers | implementation strings | Statement | A | Educational Codeforces Round 2 {600} | PROGRAMMING | Editorial | 1600 | |
6360 | Make Palindrome | constructive algorithms greedy strings | Statement | C | Educational Codeforces Round 2 {600} | PROGRAMMING | Editorial | 1800 | |
2361 | Area of Two Circles' Intersection | geometry | Statement | D | Educational Codeforces Round 2 {600} | PROGRAMMING | Editorial | 2000 | |
14574 | Lomsat gelral | data structures dfs and similar ds trees | Statement | E | Educational Codeforces Round 2 {600} | PROGRAMMING | Editorial | 2300 | |
862 | Edge coloring of bipartite graph | graphs | Statement | F | Educational Codeforces Round 2 {600} | PROGRAMMING | Editorial | 2900 | |
12310 | The Two Routes | graphs shortest paths | Statement | A | Codeforces Round 333 (Div. 1) {601} | PROGRAMMING | 1600 | ||
2337 | Lipshitz Sequence | data structures math | Statement | B | Codeforces Round 333 (Div. 1) {601} | PROGRAMMING | Codeforces Round #333 — editorial | 2200 | |
1347 | Kleofáš and the n-thlon | dp math probabilities | Statement | C | Codeforces Round 333 (Div. 1) {601} | PROGRAMMING | 2400 | ||
1170 | Acyclic Organic Compounds | data structures dfs and similar ds hashing strings trees | Statement | D | Codeforces Round 333 (Div. 1) {601} | PROGRAMMING | Codeforces Round #333 — editorial | 2400 | |
888 | A Museum Robbery | data structures dp | Statement | E | Codeforces Round 333 (Div. 1) {601} | PROGRAMMING | 2800 | ||
8566 | Two Bases | brute force implementation | Statement | A | Codeforces Round 333 (Div. 2) {602} | PROGRAMMING | 1200 | ||
11058 | Approximating a Constant Range | dp implementation two pointers | Statement | B | Codeforces Round 333 (Div. 2) {602} | PROGRAMMING | 1400 | ||
7754 | Alternative Thinking | dp greedy math | Statement | A | Codeforces Round 334 (Div. 1) {603} | PROGRAMMING | 1600 | ||
2604 | Moodular Arithmetic | combinatorics dfs and similar ds math number theory | Statement | B | Codeforces Round 334 (Div. 1) {603} | PROGRAMMING | Codeforces Round #334 Editorial | 2000 | |
1917 | Lieges of Legendre | games math | Statement | C | Codeforces Round 334 (Div. 1) {603} | PROGRAMMING | Codeforces Round #334 Editorial | 2300 | |
341 | Ruminations on Ruminants | geometry math | Statement | D | Codeforces Round 334 (Div. 1) {603} | PROGRAMMING | 2900 | ||
1340 | Pastoral Oddities | data structures divide and conquer ds math trees | Statement | E | Codeforces Round 334 (Div. 1) {603} | PROGRAMMING | 2900 | ||
9032 | Uncowed Forces | implementation | Statement | A | Codeforces Round 334 (Div. 2) {604} | PROGRAMMING | 1000 | ||
8567 | More Cowbell | binary search greedy | Statement | B | Codeforces Round 334 (Div. 2) {604} | PROGRAMMING | 1400 | ||
7205 | Sorting Railway Cars | constructive algorithms greedy | Statement | A | Codeforces Round 335 (Div. 1) {605} | PROGRAMMING | Codeforces Round #335 Problem Analysis | 1600 | |
3535 | Lazy Student | constructive algorithms data structures graphs | Statement | B | Codeforces Round 335 (Div. 1) {605} | PROGRAMMING | 1800 | ||
813 | Board Game | data structures dfs and similar | Statement | D | Codeforces Round 335 (Div. 1) {605} | PROGRAMMING | Codeforces Round #335 Problem Analysis | 2400 | |
1132 | Freelancer's Dreams | geometry | Statement | C | Codeforces Round 335 (Div. 1) {605} | PROGRAMMING | 2500 | ||
1408 | Intergalaxy Trips | probabilities shortest paths | Statement | E | Codeforces Round 335 (Div. 1) {605} | PROGRAMMING | 2600 | ||
8029 | Magic Spheres | implementation | Statement | A | Codeforces Round 335 (Div. 2) {606} | PROGRAMMING | 22019 | 1200 | |
2778 | Testing Robots | implementation | Statement | B | Codeforces Round 335 (Div. 2) {606} | PROGRAMMING | 1600 | ||
9733 | Chain Reaction | binary search dp | Statement | A | Codeforces Round 336 (Div. 1) {607} | PROGRAMMING | Codeforces Round #336 Editorial | 1600 | |
12762 | Zuma | dp | Statement | B | Codeforces Round 336 (Div. 1) {607} | PROGRAMMING | Codeforces Round #336 Editorial | 2000 | |
580 | Power Tree | data structures trees | Statement | D | Codeforces Round 336 (Div. 1) {607} | PROGRAMMING | 2600 | ||
807 | Marbles | hashing strings | Statement | C | Codeforces Round 336 (Div. 1) {607} | PROGRAMMING | 2600 | ||
257 | Cross Sum | binary search geometry | Statement | E | Codeforces Round 336 (Div. 1) {607} | PROGRAMMING | 3300 | ||
9433 | Saitama Destroys Hotel | implementation math | Statement | A | Codeforces Round 336 (Div. 2) {608} | PROGRAMMING | Codeforces Round #336 Editorial | 1100 | |
6955 | Hamming Distance Sum | combinatorics strings | Statement | B | Codeforces Round 336 (Div. 2) {608} | PROGRAMMING | 1500 | ||
9302 | Книга - лучший подарок | constructive algorithms implementation | Statement | B | Educational Codeforces Round 3 {609} | PROGRAMMING | Editorial | 1100 | |
6730 | Load Balancing | implementation math | Statement | C | Educational Codeforces Round 3 {609} | PROGRAMMING | Editorial | 1500 | |
2796 | Gadgets for dollars and pounds | binary search greedy two pointers | Statement | D | Educational Codeforces Round 3 {609} | PROGRAMMING | 2000 | ||
8228 | Minimum spanning tree for each edge | data structures dfs and similar ds graphs trees | Statement | E | Educational Codeforces Round 3 {609} | PROGRAMMING | Editorial | 2100 | |
1289 | Frogs and mosquitoes | data structures greedy | Statement | F | Educational Codeforces Round 3 {609} | PROGRAMMING | 2500 | ||
17787 | Флеш-карты | greedy implementation sortings | Statement | A | Educational Codeforces Round 3 {609} | PROGRAMMING | Editorial | 800 | |
24035 | Pasha and Stick | combinatorics math | Statement | A | Codeforces Round 337 (Div. 2) {610} | PROGRAMMING | Codeforces Round #337 (Div.2) Editorial | 1000 | |
7392 | Vika and Squares | constructive algorithms implementation | Statement | B | Codeforces Round 337 (Div. 2) {610} | PROGRAMMING | Codeforces Round #337 (Div.2) Editorial | 1300 | |
2896 | Harmony Analysis | constructive algorithms | Statement | C | Codeforces Round 337 (Div. 2) {610} | PROGRAMMING | Codeforces Round #337 (Div.2) Editorial | 1800 | |
1537 | Vika and Segments | constructive algorithms data structures geometry two pointers | Statement | D | Codeforces Round 337 (Div. 2) {610} | PROGRAMMING | Codeforces Round #337 (Div.2) Editorial | 2300 | |
916 | Alphabet Permutations | data structures strings | Statement | E | Codeforces Round 337 (Div. 2) {610} | PROGRAMMING | Codeforces Round #337 (Div.2) Editorial | 2700 | |
10270 | New Year and Old Property | bitmasks brute force implementation | Statement | B | Good Bye 2015 {611} | PROGRAMMING | Tutorial | 1300 | |
8539 | New Year and Domino | dp implementation | Statement | C | Good Bye 2015 {611} | PROGRAMMING | 1500 | ||
2615 | New Year and Ancient Prophecy | dp hashing strings | Statement | D | Good Bye 2015 {611} | PROGRAMMING | Tutorial | 1900 | |
872 | New Year and Three Musketeers | data structures greedy sortings | Statement | E | Good Bye 2015 {611} | PROGRAMMING | 2300 | ||
487 | New Year and Cleaning | binary search implementation | Statement | F | Good Bye 2015 {611} | PROGRAMMING | 2500 | ||
446 | New Year and Cake | geometry two pointers | Statement | G | Good Bye 2015 {611} | PROGRAMMING | Tutorial | 2900 | |
587 | New Year and Forgotten Tree | constructive algorithms flows graphs | Statement | H | Good Bye 2015 {611} | PROGRAMMING | 3000 | ||
11718 | New Year and Days | implementation | Statement | A | Good Bye 2015 {611} | PROGRAMMING | Tutorial | 900 | |
7179 | HDD is Outdated Technology | implementation math | Statement | B | Educational Codeforces Round 4 {612} | PROGRAMMING | 22299 | 1200 | |
7353 | The Text Splitting | brute force implementation strings | Statement | A | Educational Codeforces Round 4 {612} | PROGRAMMING | 22299 | 1300 | |
8306 | Replace To Make Regular Bracket Sequence | data structures expression parsing math | Statement | C | Educational Codeforces Round 4 {612} | PROGRAMMING | 22299 | 1500 | |
3956 | The Union of k-Segments | greedy sortings | Statement | D | Educational Codeforces Round 4 {612} | PROGRAMMING | 22299 | 1900 | |
1742 | Square Root of Permutation | combinatorics constructive algorithms dfs and similar graphs math | Statement | E | Educational Codeforces Round 4 {612} | PROGRAMMING | 22299 | 2200 | |
394 | Simba on the Circle | dp | Statement | F | Educational Codeforces Round 4 {612} | PROGRAMMING | 22299 | 2600 | |
3262 | Peter and Snow Blower | binary search geometry ternary search | Statement | A | Codeforces Round 339 (Div. 1) {613} | PROGRAMMING | Tutorial | 1900 | |
2254 | Skills | binary search brute force dp greedy sortings two pointers | Statement | B | Codeforces Round 339 (Div. 1) {613} | PROGRAMMING | Tutorial | 2200 | |
1020 | Necklace | constructive algorithms math | Statement | C | Codeforces Round 339 (Div. 1) {613} | PROGRAMMING | Tutorial | 2800 |