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 2Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
---|---|---|---|---|---|---|---|---|---|
12956 | Sum on Subarrays | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 145 (Rated for Div. 2) {1809} | PROGRAMMING | 114300 | ||
7594 | Umka and a Long Flight | constructive algorithms implementation math | Statement | D | Codeforces Round 863 (Div. 3) {1811} | PROGRAMMING | 114788 | ||
16919 | Super-Permutation | constructive algorithms math | Statement | D | Codeforces Round 867 (Div. 3) {1822} | PROGRAMMING | Codeforces Round #867 (Div. 3) Editorial | ||
23769 | Divisible Array | constructive algorithms math | Statement | A | Codeforces Round 873 (Div. 2) {1828} | PROGRAMMING | 500.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 800 |
33346 | Grasshopper on a Line | constructive algorithms math | Statement | A | Educational Codeforces Round 149 (Rated for Div. 2) {1837} | PROGRAMMING | 116752 | ||
16513 | Minimize Permutation Subarrays | constructive algorithms greedy math | Statement | B | Codeforces Round 877 (Div. 2) {1838} | PROGRAMMING | 1000.0 | Codeforces Round #877 (Div. 2) Editorial | |
1899 | Great Grids | constructive algorithms dfs and similar ds graphs math | Statement | E | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 2000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
24649 | Subtraction Game | constructive algorithms games math | Statement | A | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 500.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
15817 | Particles | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1250.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
18326 | Permutations & Primes | constructive algorithms greedy math | Statement | B | Codeforces Round 884 (Div. 1 + Div. 2) {1844} | PROGRAMMING | 1000.0 | Codeforces Round #884 (Div. 1 + Div. 2) Editorial | |
19625 | Rudolph and Christmas Tree | constructive algorithms geometry math | Statement | D | Codeforces Round 883 (Div. 3) {1846} | PROGRAMMING | |||
16942 | Vika and Her Friends | constructive algorithms games math | Statement | A | Codeforces Round 885 (Div. 2) {1848} | PROGRAMMING | 500.0 | Codeforces Round #885 (Div.2) Editorial | |
14270 | Dual (Easy Version) | constructive algorithms math | Statement | A1 | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
7070 | Dual (Hard Version) | constructive algorithms math | Statement | A2 | Codeforces Round 889 (Div. 1) {1854} | PROGRAMMING | 750.0 | Editorial of Codeforces Round 889 (Div. 1 + Div. 2) | |
24541 | Good Arrays | constructive algorithms implementation math | Statement | B | Codeforces Round 890 (Div. 2) supported by Constructor Institute {1856} | PROGRAMMING | 750.0 | Codeforces Round #890 (Div. 2) Editorial | |
33434 | United We Stand | constructive algorithms graphs math | Statement | A | Codeforces Round 892 (Div. 2) {1859} | PROGRAMMING | 500.0 | Video solutions from Geothermal. | |
20389 | Increasing and Decreasing | constructive algorithms implementation math | Statement | A | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} | PROGRAMMING | 500.0 | Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial | |
3796 | Salyg1n and Array (simple version) | constructive algorithms interactive math | Statement | E1 | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 2000.0 | ||
3219 | Salyg1n and Array (hard version) | constructive algorithms interactive math | Statement | E2 | Codeforces Round 897 (Div. 2) {1867} | PROGRAMMING | 1000.0 | ||
19118 | MEXanized Array | constructive algorithms greedy math | Statement | A | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) {1870} | PROGRAMMING | 500.0 | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!) Editorial | |
31628 | Aleksa and Stack | constructive algorithms math | Statement | B | Codeforces Round 900 (Div. 3) {1878} | PROGRAMMING | Codeforces round #900 (Div.3) Editorial | ||
930 | Colorful Constructive | constructive algorithms greedy math | Statement | D | Codeforces Round 908 (Div. 1) {1893} | PROGRAMMING | 2250.0 | Codeforces Round 908 (Div. 1, Div, 2) Editorial | |
12129 | Add, Divide and Floor | constructive algorithms greedy math | Statement | C | Educational Codeforces Round 158 (Rated for Div. 2) {1901} | PROGRAMMING | Educational Codeforces Round 158 Editorial | ||
2065 | Geo Game | constructive algorithms dp games greedy interactive math | Statement | E | Codeforces Round 912 (Div. 2) {1903} | PROGRAMMING | 2250.0 | Codeforces Round #912 (Div. 2) Editorial | |
946 | Evaluate It and Back Again | constructive algorithms implementation math | Statement | E | 2023-2024 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) {1912} | PROGRAMMING | Tutorials (PDF) | 2200 | |
30531 | Preparing for the Contest | constructive algorithms math | Statement | B | Codeforces Round 916 (Div. 3) {1914} | PROGRAMMING | Codeforces Round 916 (Div. 3) Editorial | ||
17981 | Training Before the Olympiad | constructive algorithms games implementation math | Statement | C | Good Bye 2023 {1916} | PROGRAMMING | 1250.0 | ||
25620 | Least Product | constructive algorithms math | Statement | A | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 500.0 | Editorial of Codeforces Round 917 (Div. 2) | |
1406 | Construct Matrix | constructive algorithms math | Statement | E | Codeforces Round 917 (Div. 2) {1917} | PROGRAMMING | 2500.0 | Editorial of Codeforces Round 917 (Div. 2) | |
30368 | Brick Wall | constructive algorithms greedy implementation math | Statement | A | Codeforces Round 922 (Div. 2) {1918} | PROGRAMMING | 500.0 | Codeforces Round #922 (Div. 2) Editorial | |
14177 | Klever Permutation | constructive algorithms math | Statement | E | Codeforces Round 923 (Div. 3) {1927} | PROGRAMMING | 125597 | ||
22762 | Rectangle Cutting | constructive algorithms geometry greedy math | Statement | A | Codeforces Round 924 (Div. 2) {1928} | PROGRAMMING | 500.0 | Codeforces Round 924 Editorial | |
25407 | Sasha and the Drawing | constructive algorithms greedy math | Statement | B | Codeforces Round 926 (Div. 2) {1929} | PROGRAMMING | 1000.0 | Codeforces Round #926 (Div. 2) Editorial. | |
6848 | Find a Mine | constructive algorithms geometry greedy interactive math | Statement | C | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 1500.0 | Tutorial | |
25518 | Too Min Too Max | constructive algorithms greedy math | Statement | A | Codeforces Round 931 (Div. 2) {1934} | PROGRAMMING | 500.0 | Tutorial | |
17277 | Farmer John's Challenge | constructive algorithms math | Statement | A | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 500.0 | CodeTON Round 8 Editorial | |
14000 | Bessie and MEX | constructive algorithms math | Statement | B | CodeTON Round 8 (Div. 1 + Div. 2, Rated, Prizes!) {1942} | PROGRAMMING | 1000.0 | CodeTON Round 8 Editorial | |
327 | Make Triangle | constructive algorithms math | Statement | K | European Championship 2024 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) {1949} | PROGRAMMING | European Championship 2024 (EUC) Editorial | ||
5433 | Buying Jewels | constructive algorithms greedy math | Statement | D | Codeforces Global Round 25 {1951} | PROGRAMMING | 1750.0 | Codeforces Global Round 25 Editorial | |
12958 | Nene's Magical Matrix | constructive algorithms greedy math | Statement | C | Codeforces Round 939 (Div. 2) {1956} | PROGRAMMING | 1500.0 | [Editorial] Codeforces Round 939 (Div. 2) | |
19971 | Two Friends | constructive algorithms implementation math | Statement | A | Educational Codeforces Round 165 (Rated for Div. 2) {1969} | PROGRAMMING | Educational Codeforces Round 165 Editorial | 800 | |
14979 | Manhattan Permutations | constructive algorithms greedy implementation math | Statement | C | Codeforces Round 953 (Div. 2) {1978} | PROGRAMMING | 1250.0 | 130527 | |
16114 | Corner Twist | constructive algorithms greedy implementation math | Statement | B | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 1000.0 | ||
25655 | Array Divisibility | constructive algorithms math | Statement | A | Codeforces Round 956 (Div. 2) and ByteRace 2024 {1983} | PROGRAMMING | 500.0 | ||
18301 | Large Addition | constructive algorithms implementation math | Statement | B | Codeforces Global Round 26 {1984} | PROGRAMMING | 750.0 | Codeforces Global Round 26 Editorial | |
14563 | Absolute Zero | constructive algorithms greedy math | Statement | C | Pinely Round 4 (Div. 1 + Div. 2) {1991} | PROGRAMMING | 1000.0 | Video Tutorial | |
29070 | Gorilla and Permutation | constructive algorithms math | Statement | C | Codeforces Round 957 (Div. 3) {1992} | PROGRAMMING | Shayan's Video Tutorial | ||
23883 | Find K Distinct Points with Fixed Center | constructive algorithms implementation math | Statement | A | Codeforces Round 965 (Div. 2) {1998} | PROGRAMMING | 500.0 | ||
19361 | Distanced Coloring | constructive algorithms implementation math | Statement | A | EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) {2002} | PROGRAMMING | 500.0 | ||
22835 | Battle for Survive | constructive algorithms greedy math | Statement | B | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 750.0 | ||
26961 | Zhan's Blender | constructive algorithms math | Statement | A | Codeforces Round 973 (Div. 2) {2013} | PROGRAMMING | 500.0 | ||
886 | Balanced | constructive algorithms data structures implementation math | Statement | E | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 2250.0 | ||
15075 | Medians | constructive algorithms greedy hashing implementation math | Statement | B | Codeforces Round 983 (Div. 2) {2032} | PROGRAMMING | 750.0 | ||
32341 | Sakurako and Kosuke | constructive algorithms math | Statement | A | Codeforces Round 981 (Div. 3) {2033} | PROGRAMMING |