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 ... 97 98 99 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
---|---|---|---|---|---|---|---|---|---|
29491 | Square or Not | math strings | Statement | B | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | |||
3018 | Sakurako's Test | binary search brute force greedy math number theory | Statement | H | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | |||
5426 | Sakurako's Task | binary search brute force greedy math number theory | Statement | G | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | |||
19948 | Sakurako's Hobby | dp ds graphs math | Statement | D | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | |||
36470 | Sakurako's Exam | brute force constructive algorithms greedy math | Statement | A | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | |||
13063 | Sakurako's Box | math number theory | Statement | F | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | |||
31551 | Longest Good Array | binary search brute force math | Statement | C | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | |||
10607 | Alternating String | brute force data structures dp greedy strings | Statement | E | Codeforces Round 970 (Div. 3) {2008} | PROGRAMMING | |||
1312 | Yunli's Subarray Queries (hard version) | data structures | Statement | G2 | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | |||
363 | Yunli's Subarray Queries (extreme version) | data structures trees | Statement | G3 | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | |||
4029 | Yunli's Subarray Queries (easy version) | binary search two pointers | Statement | G1 | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | |||
27658 | The Legend of Freya the Frog | implementation math | Statement | C | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | |||
15334 | Satyam and Counting | geometry math | Statement | D | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | |||
44447 | osu!mania | brute force implementation | Statement | B | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | |||
55459 | Minimize! | brute force math | Statement | A | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | |||
14212 | Klee's SUPER DUPER LARGE Array!!! | binary search math ternary search | Statement | E | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | |||
6968 | Firefly's Queries | data structures math | Statement | F | Codeforces Round 971 (Div. 4) {2009} | PROGRAMMING | |||
7426 | Message Transmission Error (easy version) | strings | Statement | C1 | Testing Round 19 (Div. 3) {2010} | PROGRAMMING | 1400 | ||
3419 | Message Transmission Error (hard version) | hashing strings two pointers | Statement | C2 | Testing Round 19 (Div. 3) {2010} | PROGRAMMING | 1700 | ||
20874 | Three Brothers | brute force implementation math | Statement | B | Testing Round 19 (Div. 3) {2010} | PROGRAMMING | 800 | ||
17658 | Alternating Sum of Numbers | implementation math | Statement | A | Testing Round 19 (Div. 3) {2010} | PROGRAMMING | 800 | ||
47 | Strange Matrix | *special graphs greedy | Statement | H | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | |||
15 | Stack and Queue | *special data structures divide and conquer | Statement | I | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | |||
350 | Split the Expression | *special | Statement | C | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | |||
629 | Shuffle | *special | Statement | B | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | |||
162 | Rock-Paper-Scissors Bot | *special greedy strings | Statement | E | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | |||
39 | Removal of a Permutation | *special | Statement | G | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | |||
1029 | Problem Solving | *special | Statement | A | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | |||
117 | Good Subarray | *special data structures greedy | Statement | F | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | |||
261 | Among Wolves | *special | Statement | D | Kotlin Heroes: Episode 11 {2011} | PROGRAMMING | |||
28178 | Zhan's Blender | constructive algorithms math | Statement | A | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 500.0 | ||
3378 | Prefix GCD | brute force dp greedy math number theory | Statement | E | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2500.0 | ||
12141 | Password Cracking | brute force constructive algorithms interactive strings | Statement | C | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 1250.0 | ||
6314 | Minimize the Difference | binary search data structures greedy implementation math | Statement | D | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | ||
111 | Game in Tree (Hard Version) | binary search data structures trees | Statement | F2 | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | ||
504 | Game in Tree (Easy Version) | binary search data structures games implementation trees | Statement | F1 | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 2000.0 | ||
24131 | Battle for Survive | constructive algorithms greedy math | Statement | B | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 750.0 | ||
3800 | Sheriff's Defense | dfs and similar dp trees | Statement | F | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | |||
22625 | Robin Hood in Town | binary search divide and conquer greedy math | Statement | C | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | |||
3799 | Robin Hood Archery | data structures games greedy hashing | Statement | H | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | |||
29345 | Robin Hood and the Major Oak | math | Statement | B | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | |||
38785 | Robin Helps | implementation | Statement | A | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | |||
12731 | Robert Hood and Mrs Hood | data structures greedy sortings | Statement | D | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | |||
5925 | Rendez-vous de Marian et Robin | graphs shortest paths | Statement | E | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | |||
1367 | Milky Days | data structures implementation | Statement | G | Codeforces Round 974 (Div. 3) {2014} | PROGRAMMING | |||
6494 | Tree Pruning | brute force data structures dfs and similar greedy sortings trees | Statement | C | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | ||
185 | Speedbreaker Counting (Medium Version) | dp greedy math | Statement | F2 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | ||
191 | Speedbreaker Counting (Hard Version) | dp greedy math | Statement | F3 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | ||
224 | Speedbreaker Counting (Easy Version) | combinatorics dp games greedy implementation math | Statement | F1 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | ||
4204 | Speedbreaker | binary search dp greedy implementation math two pointers | Statement | B | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | ||
1709 | Max Plus Min Plus Size | data structures dp ds greedy implementation matrices | Statement | D | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 1500.0 | ||
116 | Complex Segments (Hard Version) | binary search data structures divide and conquer ds greedy math sortings | Statement | E2 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 750.0 | ||
159 | Complex Segments (Easy Version) | binary search data structures divide and conquer ds greedy math sortings | Statement | E1 | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 2250.0 | ||
10652 | Cards Partition | brute force greedy implementation math | Statement | A | Codeforces Round 975 (Div. 1) {2018} | PROGRAMMING | 500.0 | ||
23816 | Max Plus Size | brute force dp greedy | Statement | A | Codeforces Round 975 (Div. 2) {2019} | PROGRAMMING | 500.0 | ||
14632 | All Pairs Segments | data structures implementation math | Statement | B | Codeforces Round 975 (Div. 2) {2019} | PROGRAMMING | 1000.0 | ||
22668 | Find Minimum Operations | bitmasks greedy math | Statement | A | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 500.0 | ||
3148 | Expected Power | bitmasks brute force dp math number theory probabilities | Statement | E | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 2000.0 | ||
207 | Count Leaves | dp math number theory | Statement | F | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 2750.0 | ||
5938 | Connect the Dots | brute force dfs and similar dp ds graphs math trees | Statement | D | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 1500.0 | ||
17380 | Brightness Begins | binary search math | Statement | B | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 750.0 | ||
15139 | Bitwise Balancing | bitmasks implementation math | Statement | C | Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 {2020} | PROGRAMMING | 1250.0 | ||
19258 | Meaning Mean | data structures greedy math sortings | Statement | A | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 500.0 | ||
15383 | Maximize Mex | brute force greedy math number theory | Statement | B | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 | ||
893 | Digital Village (Hard Version) | data structures dp ds graphs math trees | Statement | E2 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 | ||
479 | Digital Village (Extreme Version) | data structures dp graphs greedy math | Statement | E3 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1000.0 | ||
1565 | Digital Village (Easy Version) | brute force data structures dp ds graphs greedy implementation math shortest paths trees | Statement | E1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1750.0 | ||
745 | Boss, Thirsty | data structures dp greedy math | Statement | D | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 2500.0 | ||
3752 | Adjust The Presentation (Hard Version) | constructive algorithms data structures greedy implementation | Statement | C2 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 1000.0 | ||
12005 | Adjust The Presentation (Easy Version) | constructive algorithms greedy | Statement | C1 | Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) {2021} | PROGRAMMING | 750.0 | ||
11017 | Kar Salesman | greedy math | Statement | B | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1000.0 | ||
4293 | Gerrymandering | dp implementation | Statement | C | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1750.0 | ||
14672 | Bus to Pénjamo | greedy implementation math | Statement | A | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 750.0 | ||
426 | Billetes MX (Hard Version) | binary search combinatorics dfs and similar ds graphs | Statement | E2 | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1000.0 | ||
470 | Billetes MX (Easy Version) | 2-sat binary search combinatorics dfs and similar ds graphs | Statement | E1 | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 2250.0 | ||
585 | Asesino (Hard Version) | interactive | Statement | D2 | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 2000.0 | ||
3078 | Asesino (Easy Version) | binary search constructive algorithms implementation interactive | Statement | D1 | Codeforces Round 978 (Div. 2) {2022} | PROGRAMMING | 1750.0 | ||
102 | Tree of Life | dp greedy trees | Statement | E | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 2750.0 | ||
5413 | Skipping | brute force data structures dp graphs greedy shortest paths | Statement | B | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1000.0 | ||
449 | Many Games | brute force dp math | Statement | D | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 2250.0 | ||
66 | Hills and Pits | data structures data structures math math | Statement | F | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 3000.0 | ||
13168 | Concatenation of Arrays | constructive algorithms greedy math sortings | Statement | A | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 500.0 | ||
1049 | C+K+S | brute force constructive algorithms dfs and similar graphs greedy hashing math strings | Statement | C | Codeforces Round 980 (Div. 1) {2023} | PROGRAMMING | 1500.0 | ||
20085 | Profitable Interest Rate | math | Statement | A | Codeforces Round 980 (Div. 2) {2024} | PROGRAMMING | 500.0 | ||
14192 | Buying Lemonade | binary search constructive algorithms sortings | Statement | B | Codeforces Round 980 (Div. 2) {2024} | PROGRAMMING | 1000.0 | ||
157 | Variable Damage | data structures | Statement | G | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | |||
24603 | Two Screens | binary search greedy strings two pointers | Statement | A | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | |||
15446 | New Game | binary search brute force greedy implementation two pointers | Statement | C | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | |||
759 | Choose Your Queries | dfs and similar dp graphs greedy trees | Statement | F | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | |||
1905 | Card Game | combinatorics dp fft greedy math | Statement | E | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | |||
17149 | Binomial Coefficients, Kind Of | combinatorics math | Statement | B | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | |||
6311 | Attribute Checks | brute force data structures dp implementation math | Statement | D | Educational Codeforces Round 170 (Rated for Div. 2) {2025} | PROGRAMMING | |||
4458 | Sums of Segments | binary search data structures dp implementation math | Statement | D | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | |||
17189 | Perpendicular Segments | brute force geometry math | Statement | A | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | |||
13169 | Black Cells | binary search brute force greedy | Statement | B | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | |||
1317 | Best Subsequence | bitmasks dfs and similar flows graph matchings graphs | Statement | E | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | |||
236 | Bermart Ice Cream | data structures dfs and similar divide and conquer dp implementation trees | Statement | F | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | |||
9775 | Action Figures | data structures greedy | Statement | C | Educational Codeforces Round 171 (Rated for Div. 2) {2026} | PROGRAMMING | |||
1468 | The Endspeaker (Hard Version) | binary search combinatorics data structures dp greedy implementation two pointers | Statement | D2 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1000.0 | ||
5285 | The Endspeaker (Easy Version) | binary search dp graphs greedy implementation two pointers | Statement | D1 | Codeforces Round 982 (Div. 2) {2027} | PROGRAMMING | 1250.0 |