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 ... 99 100 101 102 >Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
---|---|---|---|---|---|---|---|---|---|
5210 | Shohag Loves GCD | constructive algorithms greedy math number theory | Statement | D | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2000.0 | ||
184 | Shohag Loves Counting (Hard Version) | number theory | Statement | F2 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2000.0 | ||
339 | Shohag Loves Counting (Easy Version) | combinatorics dp math number theory | Statement | F1 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2000.0 | ||
67 | Cool Swap Walk (Easy Version) | constructive algorithms implementation implementation sortings sortings | Statement | H1 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2250.0 | ||
46 | Cool Swap Walk (Hard Version) | constructive algorithms constructive algorithms constructive algorithms implementation sortings | Statement | H2 | CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!) {2039} | PROGRAMMING | 2500.0 | 3500 | |
18458 | Paint a Strip | constructive algorithms greedy math | Statement | B | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 1000.0 | ||
7987 | Ordered Permutations | constructive algorithms greedy math | Statement | C | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 1500.0 | ||
237 | Number of Cubes | combinatorics math number theory | Statement | F | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2750.0 | ||
4228 | Non Prime Tree | brute force constructive algorithms dfs and similar greedy number theory trees two pointers | Statement | D | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2000.0 | ||
20676 | Game of Division | brute force games math | Statement | A | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 500.0 | ||
1821 | Control of Randomness | combinatorics dfs and similar graphs greedy math probabilities trees | Statement | E | Codeforces Round 992 (Div. 2) {2040} | PROGRAMMING | 2250.0 | ||
48 | Trophic Balance Species | Statement | K | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | ||||
7413 | The Bento Box Adventure | implementation | Statement | A | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | |||
614 | Sheet Music | combinatorics dp | Statement | H | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | |||
861 | Selection Sort | greedy | Statement | M | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | |||
342 | Segmentation Folds | brute force dfs and similar number theory | Statement | F | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | |||
20 | Railway Construction | Statement | N | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | ||||
32 | Grid Game | Statement | G | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | ||||
1726 | Drunken Maze | dfs and similar graphs shortest paths | Statement | D | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | |||
1215 | Cube | bitmasks dp | Statement | C | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | |||
34 | Building Castle | Statement | L | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | ||||
4561 | Bowling Frame | binary search math | Statement | B | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | |||
127 | Bottle Arrangement | ds greedy | Statement | J | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | |||
5794 | Beautiful Array | constructive algorithms | Statement | E | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | |||
456 | Auto Complete | data structures implementation sortings strings trees | Statement | I | 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} | PROGRAMMING | |||
353 | Vertex Pairs | binary search brute force dfs and similar dp greedy trees | Statement | E | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | |||
595 | Two Subarrays | data structures dp implementation matrices | Statement | F | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | |||
3448 | Recommendations | binary search data structures implementation sortings | Statement | D | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | |||
17429 | Greedy Monocarp | greedy sortings | Statement | A | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | |||
15215 | Game with Colored Marbles | games greedy | Statement | B | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | |||
6614 | Competitive Fishing | greedy sortings | Statement | C | Educational Codeforces Round 172 (Rated for Div. 2) {2042} | PROGRAMMING | |||
7762 | Sums on Segments | binary search brute force data structures dp greedy math | Statement | C | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | |||
129 | Problem with Queries | binary search brute force data structures | Statement | G | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | |||
5220 | Problem about GCD | brute force math number theory | Statement | D | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | |||
601 | Nim | bitmasks dp games | Statement | F | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | |||
1288 | Matrix Transformation | bitmasks brute force dfs and similar graphs implementation | Statement | E | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | |||
16768 | Digits | math number theory | Statement | B | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | |||
21689 | Coin Transformation | brute force math | Statement | A | Educational Codeforces Round 173 (Rated for Div. 2) {2043} | PROGRAMMING | |||
35869 | Normal Problem | strings | Statement | B | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | |||
2215 | Medium Demon Problem (hard version) | dfs and similar dp ds graphs implementation trees | Statement | G2 | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | |||
4558 | Medium Demon Problem (easy version) | dfs and similar graph matchings graphs | Statement | G1 | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | |||
12693 | Insane Problem | binary search greedy implementation math | Statement | E | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | |||
33306 | Hard Problem | greedy math | Statement | C | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | |||
17910 | Harder Problem | constructive algorithms greedy math | Statement | D | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | |||
1458 | Hard Demon Problem | data structures dp implementation math | Statement | H | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | |||
39159 | Easy Problem | brute force math | Statement | A | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | |||
3677 | Easy Demon Problem | binary search brute force math number theory | Statement | F | Codeforces Round 993 (Div. 4) {2044} | PROGRAMMING | |||
3725 | Saraga | greedy strings | Statement | C | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 1400 | ||
1455 | Scrambled Scrabble | brute force greedy | Statement | A | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 1700 | ||
1203 | Mirror Maze | brute force dfs and similar graphs implementation | Statement | M | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 1800 | ||
954 | ICPC Square | math number theory | Statement | B | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 2000 | ||
750 | Microwavable Subsequence | data structures | Statement | I | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 2100 | ||
524 | X Aura | graphs shortest paths | Statement | G | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 2200 | ||
461 | Missing Separators | dp sortings string suffix structures strings | Statement | H | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 2200 | ||
207 | Xorderable Array | bitmasks data structures | Statement | J | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 2600 | ||
157 | Narrower Passageway | combinatorics data structures | Statement | E | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 2700 | ||
52 | GCDDCG | Statement | K | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 2900 | |||
66 | Grid Game 3-angle | games math | Statement | F | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 3000 | ||
81 | Buggy DFS | constructive algorithms | Statement | L | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 3000 | ||
24 | Aquatic Dragon | Statement | D | 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {2045} | PROGRAMMING | 3500 | |||
37 | Yandex Cuneiform (Hard Version) | constructive algorithms data structures greedy | Statement | F2 | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2500.0 | ||
58 | Yandex Cuneiform (Easy Version) | constructive algorithms data structures greedy | Statement | F1 | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2000.0 | ||
12244 | Swap Columns and Find a Path | greedy sortings | Statement | A | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 500.0 | ||
7497 | Move Back at a Cost | binary search data structures greedy sortings | Statement | B | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 750.0 | ||
270 | For the Emperor! | flows graphs | Statement | D | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2500.0 | ||
33 | Cheops and a Contest (Hard Version) | greedy | Statement | E2 | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 1500.0 | ||
129 | Cheops and a Contest (Easy Version) | constructive algorithms greedy | Statement | E1 | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 2000.0 | ||
1651 | Adventurers | binary search data structures sortings | Statement | C | Codeforces Round 990 (Div. 1) {2046} | PROGRAMMING | 1500.0 | ||
13703 | Replace Character | brute force combinatorics greedy strings | Statement | B | Codeforces Round 990 (Div. 2) {2047} | PROGRAMMING | 1000.0 | ||
14390 | Alyona and a Square Jigsaw Puzzle | implementation math | Statement | A | Codeforces Round 990 (Div. 2) {2047} | PROGRAMMING | 500.0 | ||
140 | Kevin and Strange Operation | data structures dp | Statement | H | Codeforces Global Round 28 {2048} | PROGRAMMING | 2750.0 | ||
16 | Kevin and Puzzle (Hard Version) | bitmasks fft math | Statement | I2 | Codeforces Global Round 28 {2048} | PROGRAMMING | 3000.0 | ||
53 | Kevin and Puzzle (Easy Version) | constructive algorithms | Statement | I1 | Codeforces Global Round 28 {2048} | PROGRAMMING | 3000.0 | ||
16478 | Kevin and Permutation | constructive algorithms greedy | Statement | B | Codeforces Global Round 28 {2048} | PROGRAMMING | 500.0 | ||
429 | Kevin and Matrices | combinatorics math | Statement | G | Codeforces Global Round 28 {2048} | PROGRAMMING | 2250.0 | ||
899 | Kevin and Math Class | brute force data structures divide and conquer dp math trees two pointers | Statement | F | Codeforces Global Round 28 {2048} | PROGRAMMING | 2000.0 | ||
6322 | Kevin and Competition Memories | binary search data structures greedy sortings two pointers | Statement | D | Codeforces Global Round 28 {2048} | PROGRAMMING | 1250.0 | ||
19263 | Kevin and Combination Lock | brute force implementation math number theory | Statement | A | Codeforces Global Round 28 {2048} | PROGRAMMING | 250.0 | ||
2550 | Kevin and Bipartite Graph | constructive algorithms graphs greedy | Statement | E | Codeforces Global Round 28 {2048} | PROGRAMMING | 1750.0 | ||
11948 | Kevin and Binary Strings | bitmasks brute force greedy strings | Statement | C | Codeforces Global Round 28 {2048} | PROGRAMMING | 1000.0 | ||
4160 | Shift + Esc | dp implementation | Statement | D | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 1750.0 | ||
14246 | pspspsps | brute force constructive algorithms implementation | Statement | B | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 750.0 | ||
351 | MEX OR Mania | bitmasks data structures implementation | Statement | F | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 2750.0 | ||
20099 | MEX Destruction | greedy implementation | Statement | A | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 500.0 | ||
9938 | MEX Cycle | constructive algorithms greedy implementation | Statement | C | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 1000.0 | ||
1105 | Broken Queries | binary search bitmasks interactive | Statement | E | Codeforces Round 994 (Div. 2) {2049} | PROGRAMMING | 2250.0 | ||
18226 | Uninteresting Number | brute force dp math | Statement | C | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | |||
3544 | Tree Destruction | dfs and similar dp greedy trees | Statement | G | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | |||
21043 | Transfusion | brute force greedy math | Statement | B | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | |||
9795 | Three Strings | dp implementation strings | Statement | E | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | |||
6319 | Maximum modulo equality | data structures math number theory | Statement | F | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | |||
29924 | Line Breaks | implementation | Statement | A | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | |||
14059 | Digital string maximization | brute force greedy math strings | Statement | D | Codeforces Round 991 (Div. 3) {2050} | PROGRAMMING | |||
1421 | Snakes | bitmasks dp graphs | Statement | G | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | |||
27190 | Preparing for the Olympiad | greedy | Statement | A | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | |||
19935 | Preparing for the Exam | constructive algorithms implementation | Statement | C | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | |||
27916 | Journey | binary search math | Statement | B | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | |||
2623 | Joker | greedy math | Statement | F | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | |||
15977 | Counting Pairs | binary search sortings two pointers | Statement | D | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING | |||
7746 | Best Price | brute force data structures greedy sortings | Statement | E | Codeforces Round 995 (Div. 3) {2051} | PROGRAMMING |