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 ... 6 7 8 9 10 ... 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
---|---|---|---|---|---|---|---|---|---|
7472 | Bag of mice | dp games math probabilities | Statement | D | Codeforces Round 105 (Div. 2) {148} | PROGRAMMING | 1900 | ||
4157 | Porcelain | dp | Statement | E | Codeforces Round 105 (Div. 2) {148} | PROGRAMMING | Codeforces Round #105 (Div. 2): editorial | 2000 | |
96231 | Insomnia cure | constructive algorithms implementation math | Statement | A | Codeforces Round 105 (Div. 2) {148} | PROGRAMMING | Codeforces Round #105 (Div. 2): editorial | 900 | |
40843 | Business trip | greedy implementation sortings | Statement | A | Codeforces Round 106 (Div. 2) {149} | PROGRAMMING | 1100 | ||
5432 | Division into Teams | greedy math sortings | Statement | C | Codeforces Round 106 (Div. 2) {149} | PROGRAMMING | 1500 | ||
2288 | Martian Clock | implementation | Statement | B | Codeforces Round 106 (Div. 2) {149} | PROGRAMMING | Editorial Round #106 | 1600 | |
2310 | Martian Strings | string suffix structures strings | Statement | E | Codeforces Round 106 (Div. 2) {149} | PROGRAMMING | 2200 | ||
3975 | Coloring Brackets | dp | Statement | D | Codeforces Round 106 (Div. 2) {149} | PROGRAMMING | Editorial Round #106 | 2200 | |
7990 | Win or Freeze | games math number theory | Statement | A | Codeforces Round 107 (Div. 1) {150} | PROGRAMMING | Tutorial | 1600 | |
4327 | Quantity of Strings | combinatorics dfs and similar graphs math | Statement | B | Codeforces Round 107 (Div. 1) {150} | PROGRAMMING | Tutorial | 1800 | |
647 | Smart Cheater | data structures math probabilities | Statement | C | Codeforces Round 107 (Div. 1) {150} | PROGRAMMING | 2300 | ||
628 | Mission Impassable | dp strings | Statement | D | Codeforces Round 107 (Div. 1) {150} | PROGRAMMING | 2600 | ||
889 | Freezing with Style | binary search data structures divide and conquer trees | Statement | E | Codeforces Round 107 (Div. 1) {150} | PROGRAMMING | 3000 | ||
6442 | Phone Numbers | implementation strings | Statement | B | Codeforces Round 107 (Div. 2) {151} | PROGRAMMING | 1300 | ||
77343 | Soft Drinking | implementation math | Statement | A | Codeforces Round 107 (Div. 2) {151} | PROGRAMMING | Codeforces Round #107. Tutorial. | 900 | |
17083 | Marks | implementation | Statement | A | Codeforces Round 108 (Div. 2) {152} | PROGRAMMING | Разбор задач Codeforces Round #108 (Div. 2) | 1100 | |
6837 | Steps | binary search implementation | Statement | B | Codeforces Round 108 (Div. 2) {152} | PROGRAMMING | 1400 | ||
10794 | Pocket Book | combinatorics | Statement | C | Codeforces Round 108 (Div. 2) {152} | PROGRAMMING | Разбор задач Codeforces Round #108 (Div. 2) | 1500 | |
491 | Garden | bitmasks dp graphs trees | Statement | E | Codeforces Round 108 (Div. 2) {152} | PROGRAMMING | 2400 | ||
247 | Frames | brute force | Statement | D | Codeforces Round 108 (Div. 2) {152} | PROGRAMMING | 2500 | ||
864 | A + B | *special | Statement | A | Surprise Language Round 5 {153} | PROGRAMMING | Surprise Language Round #5: разбор задач | 1600 | |
159 | Binary notation | *special | Statement | B | Surprise Language Round 5 {153} | PROGRAMMING | Surprise Language Round #5: разбор задач | 1800 | |
81 | Euclidean Distance | *special | Statement | E | Surprise Language Round 5 {153} | PROGRAMMING | Surprise Language Round #5: разбор задач | 2200 | |
393 | Caesar Cipher | *special | Statement | C | Surprise Language Round 5 {153} | PROGRAMMING | Surprise Language Round #5: разбор задач | 2200 | |
85 | Date Change | *special | Statement | D | Surprise Language Round 5 {153} | PROGRAMMING | Surprise Language Round #5: разбор задач | 2300 | |
4109 | Hometask | greedy | Statement | A | Codeforces Round 109 (Div. 1) {154} | PROGRAMMING | 1700 | ||
4962 | Colliders | math number theory | Statement | B | Codeforces Round 109 (Div. 1) {154} | PROGRAMMING | 1700 | ||
438 | Flatland Fencing | games math | Statement | D | Codeforces Round 109 (Div. 1) {154} | PROGRAMMING | 2300 | ||
2926 | Double Profiles | graphs hashing sortings | Statement | C | Codeforces Round 109 (Div. 1) {154} | PROGRAMMING | 2300 | ||
99 | Martian Colony | geometry | Statement | E | Codeforces Round 109 (Div. 1) {154} | PROGRAMMING | 2900 | ||
10379 | Combination | greedy sortings | Statement | B | Codeforces Round 109 (Div. 2) {155} | PROGRAMMING | Codeforces Round #109: editorial | 1200 | |
78447 | I_love_\%username\% | brute force | Statement | A | Codeforces Round 109 (Div. 2) {155} | PROGRAMMING | Codeforces Round #109: editorial | 900 | |
3057 | Message | brute force | Statement | A | Codeforces Round 110 (Div. 1) {156} | PROGRAMMING | Codeforces Round 110 — Разбор задач | 1700 | |
2257 | Suspects | constructive algorithms data structures implementation | Statement | B | Codeforces Round 110 (Div. 1) {156} | PROGRAMMING | 1800 | ||
2442 | Cipher | combinatorics dp | Statement | C | Codeforces Round 110 (Div. 1) {156} | PROGRAMMING | 2100 | ||
1645 | Clues | combinatorics graphs | Statement | D | Codeforces Round 110 (Div. 1) {156} | PROGRAMMING | 2400 | ||
163 | Mrs. Hudson's Pancakes | brute force dp | Statement | E | Codeforces Round 110 (Div. 1) {156} | PROGRAMMING | 2900 | ||
13380 | Trace | geometry sortings | Statement | B | Codeforces Round 110 (Div. 2) {157} | PROGRAMMING | 1100 | ||
7762 | Game Outcome | brute force | Statement | A | Codeforces Round 110 (Div. 2) {157} | PROGRAMMING | Codeforces Round 110 — Разбор задач | 1100 | |
89454 | Taxi | *special greedy implementation | Statement | B | VK Cup 2012 Qualification Round 1 {158} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 1800 | |
261839 | Next Round | *special implementation | Statement | A | VK Cup 2012 Qualification Round 1 {158} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 1800 | |
6270 | Ice Sculptures | *special brute force number theory | Statement | D | VK Cup 2012 Qualification Round 1 {158} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 1900 | |
9420 | Cd and pwd commands | *special data structures implementation | Statement | C | VK Cup 2012 Qualification Round 1 {158} | PROGRAMMING | 1900 | ||
1466 | Phone Talks | *special dp sortings | Statement | E | VK Cup 2012 Qualification Round 1 {158} | PROGRAMMING | 2300 | ||
2501 | Friends or Not | *special greedy implementation | Statement | A | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | 1700 | ||
3829 | Matchmaker | *special greedy sortings | Statement | B | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | 1800 | ||
3017 | String Manipulation 1.0 | *special binary search brute force data structures strings | Statement | C | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 2000 | |
4343 | Palindrome pairs | *special brute force dp strings | Statement | D | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 2000 | |
1008 | Zebra Tower | *special data structures greedy sortings | Statement | E | VK Cup 2012 Qualification Round 2 {159} | PROGRAMMING | Simple solution to vk cup Qualification Round 1 and 2 | 2100 | |
122010 | Twins | greedy sortings | Statement | A | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | 1000 | ||
14263 | Unlucky Ticket | greedy sortings | Statement | B | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | 1200 | ||
3477 | Find Pair | implementation math sortings | Statement | C | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | 1700 | ||
599 | Buses and People | binary search data structures sortings | Statement | E | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | 2400 | ||
2854 | Edges in MST | dfs and similar ds graphs sortings | Statement | D | Codeforces Round 111 (Div. 2) {160} | PROGRAMMING | 2500 | ||
4962 | Dress'em in Vests! | binary search brute force greedy two pointers | Statement | A | VK Cup 2012 Round 1 {161} | PROGRAMMING | 1300 | ||
1968 | Discounts | constructive algorithms greedy sortings | Statement | B | VK Cup 2012 Round 1 {161} | PROGRAMMING | 1700 | ||
15533 | Distance in Tree | dfs and similar dp trees | Statement | D | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 1800 | |
473 | Polycarpus the Safecracker | brute force dp | Statement | E | VK Cup 2012 Round 1 {161} | PROGRAMMING | VK Cup 2012 Round 1: editorial | 2400 | |
656 | Abracadabra | divide and conquer | Statement | C | VK Cup 2012 Round 1 {161} | PROGRAMMING | 2400 | ||
817 | Pentagonal numbers | *special implementation | Statement | A | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 1400 | |
315 | Binary notation | *special | Statement | B | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 1800 | |
229 | Remove digits | *special | Statement | D | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 1900 | |
179 | HQ9+ | *special | Statement | E | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2000 | |
205 | Factorial zeros | *special | Statement | F | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2100 | |
853 | Prime factorization | *special | Statement | C | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2200 | |
222 | Alternating case | *special | Statement | H | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2300 | |
99 | Brackets | *special | Statement | J | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2400 | |
78 | Truncatable primes | *special | Statement | I | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2500 | |
67 | Non-decimal sum | *special | Statement | G | VK Cup 2012 Wild-card Round 1 {162} | PROGRAMMING | VK Cup 2012 Wild-card Round 1: editorial | 2500 | |
2749 | Substring and Subsequence | dp | Statement | A | VK Cup 2012 Round 2 {163} | PROGRAMMING | 1900 | ||
1071 | Lemmings | binary search | Statement | B | VK Cup 2012 Round 2 {163} | PROGRAMMING | 2100 | ||
559 | Conveyor | sortings two pointers | Statement | C | VK Cup 2012 Round 2 {163} | PROGRAMMING | 2200 | ||
516 | Large Refrigerator | brute force | Statement | D | VK Cup 2012 Round 2 {163} | PROGRAMMING | 2800 | ||
1759 | e-Government | data structures dfs and similar dp strings trees | Statement | E | VK Cup 2012 Round 2 {163} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 2800 | |
1021 | Variable, or There and Back Again | dfs and similar graphs | Statement | A | VK Cup 2012 Round 3 {164} | PROGRAMMING | 2000 | ||
479 | Ancient Berland Hieroglyphs | two pointers | Statement | B | VK Cup 2012 Round 3 {164} | PROGRAMMING | 2300 | ||
906 | Machine Programming | flows graphs | Statement | C | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 2400 | |
248 | Minimum Diameter | binary search brute force | Statement | D | VK Cup 2012 Round 3 {164} | PROGRAMMING | VK Cup 2012 Round 3 — Разбор | 2900 | |
67 | Polycarpus and Tasks | Statement | E | VK Cup 2012 Round 3 {164} | PROGRAMMING | 3100 | |||
24047 | Supercentral Point | implementation | Statement | A | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 1100 | |
18881 | Burning Midnight Oil | binary search implementation | Statement | B | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 1500 | |
12503 | Another Problem on Strings | binary search brute force dp math strings two pointers | Statement | C | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 1600 | |
7205 | Compatible Numbers | bitmasks brute force dfs and similar dp | Statement | E | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | Codeforces Round #112 (Div. 2) Tutorial | 2100 | |
1707 | Beard Graph | data structures ds trees | Statement | D | Codeforces Round 112 (Div. 2) {165} | PROGRAMMING | 2200 | ||
18165 | Rank List | binary search implementation sortings | Statement | A | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | 1200 | ||
21830 | Tetrahedron | dp math matrices | Statement | E | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 1500 | |
6590 | Median | greedy math sortings | Statement | C | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | 1500 | ||
2550 | Polygons | geometry sortings | Statement | B | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | Codeforces Round #113 (Div. 2) Tutorial | 2000 | |
367 | Shoe Store | dp graph matchings greedy sortings two pointers | Statement | D | Codeforces Round 113 (Div. 2) {166} | PROGRAMMING | 2400 | ||
2050 | Wizards and Trolleybuses | implementation | Statement | A | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | 1600 | ||
2188 | Wizards and Huge Prize | dp math probabilities | Statement | B | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | 2000 | ||
683 | Wizards and Numbers | games math | Statement | C | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | Codeforces Round #114 — Tutorial | 2400 | |
200 | Wizards and Roads | data structures divide and conquer graph matchings graphs greedy | Statement | D | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | 2900 | ||
582 | Wizards and Bets | dfs and similar graphs math matrices | Statement | E | Codeforces Round 114 (Div. 1) {167} | PROGRAMMING | 2900 | ||
10722 | Wizards and Demonstration | implementation math | Statement | A | Codeforces Round 114 (Div. 2) {168} | PROGRAMMING | 1000 | ||
1225 | Wizards and Minimal Spell | implementation strings | Statement | B | Codeforces Round 114 (Div. 2) {168} | PROGRAMMING | Codeforces Round #114 — Tutorial | 1700 | |
3347 | Replacing Digits | greedy | Statement | B | VK Cup 2012 Round 2 (Unofficial Div. 2 Edition) {169} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 1200 | |
7095 | Chores | sortings | Statement | A | VK Cup 2012 Round 2 (Unofficial Div. 2 Edition) {169} | PROGRAMMING | VK Cup 2012 Round 2 — Разбор | 900 | |
4539 | Mysterious numbers - 1 | *special constructive algorithms | Statement | A | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 1200 | |
4110 | Star | *special combinatorics | Statement | B | April Fools Day Contest {171} | PROGRAMMING | April Fools Day Contest: editorial | 1300 |