Problems — CP Platform

#	Problem	Tags	Rating
977-D	Divide by three, multiply by two	dfs and similar math sortings	1400
977-C	Less or Equal	sortings	1200
977-B	Two-gram	implementation strings	900
977-A	Wrong Subtraction	implementation	800
976-F	Minimal k-covering	flows graphs	2500
976-E	Well played!	greedy sortings	2100
976-D	Degree Set	constructive algorithms graphs implementation	2500
976-C	Nested Segments	greedy implementation sortings	1500
976-B	Lara Croft and the New Game	implementation math	1300
976-A	Minimum Binary Number	implementation	800
975-E	Hag's Khashba	geometry	2600
975-D	Ghosts	geometry math	2000
975-C	Valhalla Siege	binary search	1400
975-B	Mancala	brute force implementation	1100
975-A	Aramic script	implementation strings	900
967-B	Watering System	math sortings	1000
967-A	Mind the Gap	implementation	1100
965-E	Short Code	data structures dp greedy +2	2200
965-D	Single-use Stones	binary search flows greedy +1	1900
965-C	Greedy Arkady	math	2000
965-B	Battleship	implementation	1300
965-A	Paper Airplanes	math	800
964-B	Messages	math	1300
964-A	Splits	math	800
963-E	Circles of Waiting	math	3100
963-D	Frequency of String	hashing string suffix structures strings	2500
963-C	Cutting Rectangle	brute force math number theory	2600
963-B	Destruction of a Tree	constructive algorithms dfs and similar dp +2	2000
963-A	Alternating Sum	math number theory	1800
962-G	Visible Black Areas	data structures dsu geometry +1	2800
962-F	Simple Cycles Edges	dfs and similar graphs trees	2400
962-E	Byteland, Berland and Disputed Cities	constructive algorithms greedy	2200
962-D	Merge Equals	data structures implementation	1600
962-C	Make a Square	brute force implementation math	1400
962-B	Students in Railway Carriage	constructive algorithms greedy implementation	1300
962-A	Equator	implementation	1300
961-G	Partitions	combinatorics math number theory	2700
961-F	k-substrings	binary search hashing string suffix structures	2700
961-E	Tufurama	data structures	1900
961-D	Pair Of Lines	geometry	2000
961-C	Chessboard	bitmasks brute force implementation	1400
961-B	Lecture Sleep	data structures dp implementation +1	1200
961-A	Tetris	implementation	900
960-H	Santa's Gift	data structures trees	3100
960-G	Bandit Blues	combinatorics dp fft +1	2900
960-F	Pathwalks	data structures dp graphs	2100
960-E	Alternating Tree	combinatorics dfs and similar divide and conquer +3	2300
960-D	Full Binary Tree Queries	brute force implementation trees	2100
960-C	Subsequence Counting	bitmasks constructive algorithms greedy +1	1700
960-B	Minimize the error	data structures greedy sortings	1500