Problemset - Codeforces

Problems

#	Name
1980F2	Field Division (hard version) math, sortings	2400	x1072
1980F1	Field Division (easy version) data structures, math, sortings	1900	x3931
1980E	Permutation of Rows and Columns constructive algorithms, data structures, greedy, hashing, implementation, math, matrices, sortings	1600	x11158
1980D	GCD-sequence greedy, implementation, math, number theory	1400	x15127
1979F	Kostyanych's Theorem brute force, constructive algorithms, graphs, interactive	2900	x348
1979E	Manhattan Triangle binary search, constructive algorithms, data structures, geometry, implementation, two pointers	2400	x1565
1979D	Fixing a Binary String bitmasks, brute force, constructive algorithms, dp, greedy, hashing, strings	1800	x6955
1978F	Large Graph data structures, dfs and similar, dsu, graphs, number theory, two pointers	2400	x1410
1978E	Computing Machine brute force, data structures, dp, greedy, implementation	2000	x4047
1978D	Elections data structures, greedy, implementation, math	1600	x11991
1977E	Tensor constructive algorithms, graphs, interactive	2600	x737
1977D	XORificator bitmasks, brute force, greedy, hashing	2300	x1994
1977C	Nikita and LCM brute force, data structures, dp, greedy, math, number theory, sortings	1900	x7075
1976F	Remove Bridges data structures, dfs and similar, dp, greedy, sortings, trees	2800	x649
1976E	Splittable Permutations combinatorics, data structures, dfs and similar, greedy, math, trees	2500	x1127
1976D	Invertible Bracket Sequences binary search, combinatorics, data structures, divide and conquer, implementation, two pointers	2000	x4878
1976C	Job Interview binary search, dp, greedy, implementation, two pointers	1600	x10946
1975I	Mind Bloom dp	3500	x130
1975H	378QAQ and Core greedy, strings	3500	x191
1975G	Zimpha Fan Club fft, greedy, math, strings	3000	x311
1975F	Set bitmasks, brute force, combinatorics, dfs and similar, divide and conquer, dp, math	2600	x892
1975E	Chain Queries binary search, data structures, dfs and similar, implementation, trees	2100	x2468
1975D	Paint the Tree brute force, dfs and similar, dp, greedy, shortest paths, trees	1700	x6424
1974G	Money Buys Less Happiness Now data structures, greedy, sortings	2000	x4635
1974F	Cutting Game binary search, brute force, data structures, implementation, sortings, two pointers	1900	x3753
1974E	Money Buys Happiness dp	1800	x8665
1974D	Ingenuity-2 constructive algorithms, greedy, implementation	1400	x15689
1974C	Beautiful Triple Pairs combinatorics, data structures	1400	x16637
1973F	Maximum GCD Sum Queries bitmasks, brute force, dp, implementation, number theory	3100	x259
1973E	Cat, Fox and Swaps graphs, math, sortings	2500	x860
1973D	Cat, Fox and Maximum Array Split brute force, interactive, math	2400	x2005
1973C	Cat, Fox and Double Maximum constructive algorithms, greedy, implementation, math, sortings	1700	x8836
1971H	±1 2-sat, dfs and similar, graphs	2100	x2019
1971G	XOUR data structures, dsu, sortings	1700	x9853
1971F	Circle Perimeter binary search, brute force, dfs and similar, geometry, implementation, math	1600	x10795
1971E	Find the Car binary search, math, sortings	1500	x15451
1970G3	Min-Fund Prison (Hard) bitmasks, dfs and similar, dp, graphs, trees	2400	x390
1970G2	Min-Fund Prison (Medium) brute force, dfs and similar, dp, graphs, trees	2200	x660
1970G1	Min-Fund Prison (Easy) dfs and similar, trees	1900	x1468
1970F3	Playing Quidditch (Hard) implementation	2300	x381
1970F2	Playing Quidditch (Medium) implementation	2300	x366
1970F1	Playing Quidditch (Easy) implementation	2300	x448
1970E3	Trails (Hard) dp, matrices	2200	x834
1970E2	Trails (Medium) dp, matrices	2000	x1478
1970E1	Trails (Easy) dp	1800	x2534
1970D3	Arithmancy (Hard) interactive	3100	x125
1970D2	Arithmancy (Medium) constructive algorithms, interactive, probabilities, strings	2600	x235
1970D1	Arithmancy (Easy) brute force, constructive algorithms, interactive, strings	2100	x720
1970C3	Game on Tree (Hard) dfs and similar, dp, games, trees	1900	x1762
1970C2	Game on Tree (Medium) dfs and similar, dp, games, trees	1700	x3155
1970C1	Game on Tree (Easy) games	1400	x3899
1970B3	Exact Neighbours (Hard) constructive algorithms	2300	x537
1970B2	Exact Neighbours (Medium) constructive algorithms	2100	x894
1970B1	Exact Neighbours (Easy) constructive algorithms	1900	x1274
1970A3	Balanced Unshuffle (Hard) constructive algorithms, trees	2400	x530
1970A2	Balanced Unshuffle (Medium) brute force, constructive algorithms, trees	2400	x491
1969F	Card Pairing dp, greedy, hashing, implementation	3000	x313
1969E	Unique Array binary search, data structures, divide and conquer, dp, greedy	2400	x1530
1969D	Shop Game data structures, greedy, math, sortings	1900	x4922
1969C	Minimizing the Sum dp, implementation	1700	x9481
1968G2	Division + LCP (hard version) binary search, brute force, data structures, dp, hashing, math, string suffix structures, strings	2200	x2093
1968G1	Division + LCP (easy version) binary search, data structures, dp, hashing, string suffix structures, strings	1900	x4514
1968F	Equal XOR Segments binary search, data structures	1800	x5878
1968E	Cells Arrangement constructive algorithms	1600	x11080
1967F	Next and Prev brute force, data structures, implementation	3200	x75
1967E2	Again Counting Arrays (Hard Version) combinatorics, dp, math	3500	x127
1967E1	Again Counting Arrays (Easy Version) combinatorics, dp, fft, math	3100	x239
1967D	Long Way to be Non-decreasing binary search, dfs and similar, graphs, implementation, shortest paths, two pointers	2800	x723
1967C	Fenwick Tree bitmasks, brute force, combinatorics, data structures, dp, math, trees	2300	x1878
1967B2	Reverse Card (Hard Version) brute force, math, number theory	2200	x4122
1967B1	Reverse Card (Easy Version) brute force, math, number theory	1400	x14083
1967A	Permutation Counting binary search, greedy, implementation, math, sortings	1400	x13279
1965F	Conference data structures, flows	3300	x214
1965E	Connected Cubes constructive algorithms, games	3100	x326
1965D	Missing Subarray Sum constructive algorithms	2900	x458
1965C	Folding Strip constructive algorithms, greedy, strings	2300	x2064
1965B	Missing Subsequence Sum bitmasks, constructive algorithms, greedy, number theory	1800	x7145
1965A	Everything Nim games, greedy, math, sortings	1400	x14619
1958J	Necromancer *special problem	3200	x36
1958I	Equal Trees *special problem, graphs, meet-in-the-middle	3100	x37
1958H	Composite Spells *special problem, dp	2600	x81
1958G	Observation Towers *special problem	2400	x113
1958F	Narrow Paths *special problem, combinatorics	2000	x211
1958E	Yet Another Permutation Constructive *special problem, constructive algorithms	1900	x284
1958D	Staircase *special problem	1600	x572
1958C	Firewood *special problem	1500	x801
1958B	Clock in the Pool *special problem, math	1400	x1000
1957F2	Frequency Mismatch (Hard Version) binary search, data structures, dfs and similar, hashing, probabilities, trees	2700	x482
1957F1	Frequency Mismatch (Easy Version) binary search, data structures, divide and conquer, hashing, probabilities, trees	2600	x541
1957E	Carousel of Combinations brute force, combinatorics, dp, math, number theory	2400	x1359
1957D	A BIT of an Inequality bitmasks, brute force, dp, math	1900	x4777
1957C	How Does the Rook Move? combinatorics, dp, math	1600	x10297
1956F	Nene and the Passing Game constructive algorithms, data structures, dsu, graphs, sortings	3000	x400
1956E2	Nene vs. Monsters (Hard Version) brute force, greedy, implementation, math	2700	x928
1956E1	Nene vs. Monsters (Easy Version) brute force, implementation, math	2500	x1514
1956D	Nene and the Mex Operator bitmasks, brute force, constructive algorithms, divide and conquer, dp, greedy, implementation, math	2000	x4144
1956C	Nene's Magical Matrix constructive algorithms, greedy, math	1600	x13681
1955H	The Most Reckless Defense bitmasks, brute force, constructive algorithms, dp, flows, graph matchings, shortest paths	2300	x1327
1955G	GCD on a grid brute force, dfs and similar, dp, implementation, math, number theory	1900	x4864
1955F	Unfair Game dp, games, greedy, math, schedules	1800	x7519