Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1084	P1706D1 Chopping Carrots (Easy Version) binary search brute force constructive algorithms greedy number theory *1700	0 / 0	5
	1083	P1706D2 Chopping Carrots (Hard Version) brute force constructive algorithms data structures dp greedy math number theory two pointers *2400	0 / 0	9
	1082	P1706E Qpwoeirut and Vertices binary search data structures dfs and similar divide and conquer dsu greedy trees *2300	0 / 0	8
	1081	P1707A Doremy's IQ binary search constructive algorithms greedy implementation *1600	0 / 0	5
	1080	P1707B Difference Array brute force data structures implementation sortings *1900	0 / 0	6
	1079	P1707C DFS Trees dfs and similar dsu graphs greedy sortings trees *2400	0 / 0	9
	1078	P1707D Partial Virtual Trees combinatorics dfs and similar dp math trees *3000	0 / 0	10
	1077	P1707E Replace binary search data structures *3500	0 / 0	10
	1076	P1707F Bugaboo bitmasks constructive algorithms dp number theory *3500	0 / 0	10
	1075	P1708A Difference Operations greedy math *800	0 / 0	3
	1074	P1708B Difference of GCDs constructive algorithms math *1100	0 / 0	3
	1073	P1709A Three Doors brute force greedy implementation math *800	0 / 0	3
	1072	P1709B Also Try Minecraft data structures dp implementation *900	0 / 0	3
	1071	P1709C Recover an RBS constructive algorithms greedy implementation strings *1800	0 / 0	6
	1070	P1709D Rorororobot binary search data structures greedy math *1700	0 / 0	5
	1069	P1709E XOR Tree bitmasks data structures dfs and similar dsu greedy trees *2400	0 / 0	9
	1068	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	9
	1067	P1710A Color the Picture constructive algorithms greedy math *1500	0 / 0	5
	1066	P1710B Rain binary search brute force data structures geometry greedy implementation math *2100	0 / 0	7
	1065	P1710C XOR Triangle bitmasks brute force constructive algorithms dp greedy math *2500	0 / 0	9
	1064	P1710D Recover the Tree constructive algorithms trees *3400	0 / 0	10
	1063	P1710E Two Arrays binary search games graph matchings *2400	0 / 0	9
	1062	P1711A Perfect Permutation constructive algorithms *800	0 / 0	3
	1061	P1711B Party brute force graphs *1300	0 / 0	4
	1060	P1712A Wonderful Permutation greedy implementation *800	0 / 0	3
	1059	P1712B Woeful Permutation constructive algorithms greedy number theory *800	0 / 0	3
	1058	P1712C Sort Zero greedy sortings *1100	0 / 0	3
	1057	P1712D Empty Graph binary search constructive algorithms data structures greedy shortest paths *2000	0 / 0	7
	1056	P1712E1 LCM Sum (easy version) binary search brute force combinatorics math number theory two pointers *2300	0 / 0	8
	1055	P1712E2 LCM Sum (hard version) brute force data structures math number theory two pointers *2500	0 / 0	9
	1054	P1712F Triameter binary search data structures dfs and similar trees *3200	0 / 0	10
	1053	P1713A Traveling Salesman Problem geometry greedy implementation *800	0 / 0	3
	1052	P1713B Optimal Reduction constructive algorithms sortings *1000	0 / 0	3
	1051	P1713C Build Permutation constructive algorithms dp math *1200	0 / 0	4
	1050	P1713D Tournament Countdown constructive algorithms greedy interactive number theory probabilities *1800	0 / 0	6
	1049	P1713E Cross Swapping 2-sat data structures dsu greedy matrices *2400	0 / 0	9
	1048	P1713F Lost Array bitmasks combinatorics constructive algorithms dp math *2900	0 / 0	10
	1047	P1714A Everyone Loves to Sleep implementation math *900	0 / 0	3
	1046	P1714B Remove Prefix data structures greedy implementation *800	0 / 0	3
	1045	P1714C Minimum Varied Number greedy *800	0 / 0	3
	1044	P1714D Color with Occurrences brute force data structures dp greedy strings *1600	0 / 0	5
	1043	P1714E Add Modulo 10 brute force math number theory *1400	0 / 0	4
	1042	P1714F Build a Tree and That Is It constructive algorithms implementation trees *1900	0 / 0	6
	1041	P1714G Path Prefixes binary search data structures dfs and similar trees *1700	0 / 0	5
	1040	P1715A Crossmarket constructive algorithms greedy math *800	0 / 0	3
	1039	P1715B Beautiful Array constructive algorithms greedy math *1000	0 / 0	3
	1038	P1715C Monoblock combinatorics data structures implementation math *1700	0 / 0	5
	1037	P1715D 2+ doors 2-sat bitmasks graphs greedy *1900	0 / 0	6
	1036	P1715E Long Way Home data structures divide and conquer dp geometry graphs greedy shortest paths *2400	0 / 0	9
	1035	P1715F Crop Squares constructive algorithms geometry interactive math *2700	0 / 0	10
	1034	P1716A 2-3 Moves greedy math *800	0 / 0	3
	1033	P1716B Permutation Chain constructive algorithms math *800	0 / 0	3
	1032	P1716C Robot in a Hallway data structures dp greedy implementation ternary search *2000	0 / 0	7
	1031	P1716D Chip Move brute force dp math *2000	0 / 0	7
	1030	P1716E Swap and Maximum Block bitmasks data structures dfs and similar divide and conquer dp *2500	0 / 0	9
	1029	P1716F Bags with Balls combinatorics dp math number theory *2500	0 / 0	9
	1028	P1717A Madoka and Strange Thoughts math number theory *800	0 / 0	3
	1027	P1717B Madoka and Underground Competitions constructive algorithms implementation *1100	0 / 0	3
	1026	P1717C Madoka and Formal Statement greedy *1300	0 / 0	4
	1025	P1717D Madoka and The Corruption Scheme combinatorics constructive algorithms greedy math *1900	0 / 0	6
	1024	P1717E Madoka and The Best University math number theory *2200	0 / 0	8
	1023	P1717F Madoka and The First Session constructive algorithms flows graph matchings graphs implementation *2500	0 / 0	9
	1022	P1718A1 Burenka and Traditions (easy version) dp greedy *1800	0 / 0	6
	1021	P1718A2 Burenka and Traditions (hard version) data structures dp greedy *1900	0 / 0	6
	1020	P1718B Fibonacci Strings greedy implementation math number theory *2000	0 / 0	7
	1019	P1718C Tonya and Burenka-179 data structures greedy math number theory *2400	0 / 0	9
	1018	P1718D Permutation for Burenka data structures graph matchings greedy math trees *3300	0 / 0	10
	1017	P1718E Impressionism constructive algorithms graphs implementation math *3500	0 / 0	10
	1016	P1718F Burenka, an Array and Queries data structures math number theory *3300	0 / 0	10
	1015	P1719A Chip Game games math *800	0 / 0	3
	1014	P1719B Mathematical Circus constructive algorithms math *800	0 / 0	3
	1013	P1719C Fighting Tournament binary search data structures implementation two pointers *1400	0 / 0	4
	1012	P1720A Burenka Plays with Fractions math number theory *900	0 / 0	3
	1011	P1720B Interesting Sum brute force data structures greedy math sortings *800	0 / 0	3
	1010	P1720C Corners greedy implementation *1200	0 / 0	4
	1009	P1720D1 Xor-Subsequence (easy version) bitmasks brute force dp strings trees two pointers *1800	0 / 0	6
	1008	P1720D2 Xor-Subsequence (hard version) bitmasks data structures dp strings trees *2400	0 / 0	9
	1007	P1720E Misha and Paintings constructive algorithms data structures greedy implementation math *2700	0 / 0	10
	1006	P1721A Image greedy implementation *800	0 / 0	3
	1005	P1721B Deadly Laser implementation *1000	0 / 0	3
	1004	P1721C Min-Max Array Transformation binary search greedy two pointers *1400	0 / 0	4
	1003	P1721D Maximum AND bitmasks dfs and similar divide and conquer greedy sortings *1800	0 / 0	6
	1002	P1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	8
	1001	P1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	10
	1000	P1722A Spell Check implementation *800	0 / 0	3
	999	P1722B Colourblindness implementation *800	0 / 0	3
	998	P1722C Word Game data structures implementation *800	0 / 0	3
	997	P1722D Line greedy sortings *1100	0 / 0	3
	996	P1722E Counting Rectangles brute force data structures dp implementation *1600	0 / 0	5
	995	P1722F L-shapes dfs and similar implementation *1700	0 / 0	5
	994	P1722G Even-Odd XOR bitmasks constructive algorithms greedy *1500	0 / 0	5
	993	P1725A Accumulation of Dominoes math *800	0 / 0	3
	992	P1725B Basketball Together binary search greedy sortings *1000	0 / 0	3
	991	P1725C Circular Mirror binary search combinatorics geometry math two pointers *2000	0 / 0	7
	990	P1725D Deducing Sortability binary search bitmasks math *2900	0 / 0	10
	989	P1725E Electrical Efficiency combinatorics data structures dp math number theory trees *2500	0 / 0	9
	988	P1725F Field Photography bitmasks data structures sortings *2100	0 / 0	7
	987	P1725G Garage binary search geometry math *1500	0 / 0	5
	986	P1725H Hot Black Hot White constructive algorithms math *1800	0 / 0	6
	985	P1725I Imitating the Key Tree combinatorics dsu trees *2800	0 / 0	10

Pick a problem randomly based on the current filter.