Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1056	codeforces#P1712E1 LCM Sum (easy version) binary search brute force combinatorics math number theory two pointers *2300	0 / 0	8
	1055	codeforces#P1712E2 LCM Sum (hard version) brute force data structures math number theory two pointers *2500	0 / 0	9
	1054	codeforces#P1712F Triameter binary search data structures dfs and similar trees *3200	0 / 0	10
	1053	codeforces#P1713A Traveling Salesman Problem geometry greedy implementation *800	0 / 0	3
	1052	codeforces#P1713B Optimal Reduction constructive algorithms sortings *1000	0 / 0	3
	1051	codeforces#P1713C Build Permutation constructive algorithms dp math *1200	0 / 0	4
	1050	codeforces#P1713D Tournament Countdown constructive algorithms greedy interactive number theory probabilities *1800	0 / 0	6
	1049	codeforces#P1713E Cross Swapping 2-sat data structures dsu greedy matrices *2400	0 / 0	9
	1048	codeforces#P1713F Lost Array bitmasks combinatorics constructive algorithms dp math *2900	0 / 0	10
	1047	codeforces#P1714A Everyone Loves to Sleep implementation math *900	0 / 0	3
	1046	codeforces#P1714B Remove Prefix data structures greedy implementation *800	0 / 0	3
	1045	codeforces#P1714C Minimum Varied Number greedy *800	0 / 0	3
	1044	codeforces#P1714D Color with Occurrences brute force data structures dp greedy strings *1600	0 / 0	5
	1043	codeforces#P1714E Add Modulo 10 brute force math number theory *1400	0 / 0	4
	1042	codeforces#P1714F Build a Tree and That Is It constructive algorithms implementation trees *1900	0 / 0	6
	1041	codeforces#P1714G Path Prefixes binary search data structures dfs and similar trees *1700	0 / 0	5
	1040	codeforces#P1715A Crossmarket constructive algorithms greedy math *800	0 / 0	3
	1039	codeforces#P1715B Beautiful Array constructive algorithms greedy math *1000	0 / 0	3
	1038	codeforces#P1715C Monoblock combinatorics data structures implementation math *1700	0 / 0	5
	1037	codeforces#P1715D 2+ doors 2-sat bitmasks graphs greedy *1900	0 / 0	6
	1036	codeforces#P1715E Long Way Home data structures divide and conquer dp geometry graphs greedy shortest paths *2400	0 / 0	9
	1035	codeforces#P1715F Crop Squares constructive algorithms geometry interactive math *2700	0 / 0	10
	1034	codeforces#P1716A 2-3 Moves greedy math *800	0 / 0	3
	1033	codeforces#P1716B Permutation Chain constructive algorithms math *800	0 / 0	3
	1032	codeforces#P1716C Robot in a Hallway data structures dp greedy implementation ternary search *2000	0 / 0	7
	1031	codeforces#P1716D Chip Move brute force dp math *2000	0 / 0	7
	1030	codeforces#P1716E Swap and Maximum Block bitmasks data structures dfs and similar divide and conquer dp *2500	0 / 0	9
	1029	codeforces#P1716F Bags with Balls combinatorics dp math number theory *2500	0 / 0	9
	1028	codeforces#P1717A Madoka and Strange Thoughts math number theory *800	0 / 0	3
	1027	codeforces#P1717B Madoka and Underground Competitions constructive algorithms implementation *1100	0 / 0	3
	1026	codeforces#P1717C Madoka and Formal Statement greedy *1300	0 / 0	4
	1025	codeforces#P1717D Madoka and The Corruption Scheme combinatorics constructive algorithms greedy math *1900	0 / 0	6
	1024	codeforces#P1717E Madoka and The Best University math number theory *2200	0 / 0	8
	1023	codeforces#P1717F Madoka and The First Session constructive algorithms flows graph matchings graphs implementation *2500	0 / 0	9
	1022	codeforces#P1718A1 Burenka and Traditions (easy version) dp greedy *1800	0 / 0	6
	1021	codeforces#P1718A2 Burenka and Traditions (hard version) data structures dp greedy *1900	0 / 0	6
	1020	codeforces#P1718B Fibonacci Strings greedy implementation math number theory *2000	0 / 0	7
	1019	codeforces#P1718C Tonya and Burenka-179 data structures greedy math number theory *2400	0 / 0	9
	1018	codeforces#P1718D Permutation for Burenka data structures graph matchings greedy math trees *3300	0 / 0	10
	1017	codeforces#P1718E Impressionism constructive algorithms graphs implementation math *3500	0 / 0	10
	1016	codeforces#P1718F Burenka, an Array and Queries data structures math number theory *3300	0 / 0	10
	1015	codeforces#P1719A Chip Game games math *800	0 / 0	3
	1014	codeforces#P1719B Mathematical Circus constructive algorithms math *800	0 / 0	3
	1013	codeforces#P1719C Fighting Tournament binary search data structures implementation two pointers *1400	0 / 0	4
	1012	codeforces#P1720A Burenka Plays with Fractions math number theory *900	0 / 0	3
	1011	codeforces#P1720B Interesting Sum brute force data structures greedy math sortings *800	0 / 0	3
	1010	codeforces#P1720C Corners greedy implementation *1200	0 / 0	4
	1009	codeforces#P1720D1 Xor-Subsequence (easy version) bitmasks brute force dp strings trees two pointers *1800	0 / 0	6
	1008	codeforces#P1720D2 Xor-Subsequence (hard version) bitmasks data structures dp strings trees *2400	0 / 0	9
	1007	codeforces#P1720E Misha and Paintings constructive algorithms data structures greedy implementation math *2700	0 / 0	10
	1006	codeforces#P1721A Image greedy implementation *800	0 / 0	3
	1005	codeforces#P1721B Deadly Laser implementation *1000	0 / 0	3
	1004	codeforces#P1721C Min-Max Array Transformation binary search greedy two pointers *1400	0 / 0	4
	1003	codeforces#P1721D Maximum AND bitmasks dfs and similar divide and conquer greedy sortings *1800	0 / 0	6
	1002	codeforces#P1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	8
	1001	codeforces#P1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	10
	1000	codeforces#P1722A Spell Check implementation *800	0 / 0	3
	999	codeforces#P1722B Colourblindness implementation *800	0 / 0	3
	998	codeforces#P1722C Word Game data structures implementation *800	0 / 0	3
	997	codeforces#P1722D Line greedy sortings *1100	0 / 0	3
	996	codeforces#P1722E Counting Rectangles brute force data structures dp implementation *1600	0 / 0	5
	995	codeforces#P1722F L-shapes dfs and similar implementation *1700	0 / 0	5
	994	codeforces#P1722G Even-Odd XOR bitmasks constructive algorithms greedy *1500	0 / 0	5
	993	codeforces#P1725A Accumulation of Dominoes math *800	0 / 0	3
	992	codeforces#P1725B Basketball Together binary search greedy sortings *1000	0 / 0	3
	991	codeforces#P1725C Circular Mirror binary search combinatorics geometry math two pointers *2000	0 / 0	7
	990	codeforces#P1725D Deducing Sortability binary search bitmasks math *2900	0 / 0	10
	989	codeforces#P1725E Electrical Efficiency combinatorics data structures dp math number theory trees *2500	0 / 0	9
	988	codeforces#P1725F Field Photography bitmasks data structures sortings *2100	0 / 0	7
	987	codeforces#P1725G Garage binary search geometry math *1500	0 / 0	5
	986	codeforces#P1725H Hot Black Hot White constructive algorithms math *1800	0 / 0	6
	985	codeforces#P1725I Imitating the Key Tree combinatorics dsu trees *2800	0 / 0	10
	984	codeforces#P1725J Journey dp trees *2500	0 / 0	9
	983	codeforces#P1725K Kingdom of Criticism data structures dsu *2500	0 / 0	9
	982	codeforces#P1725L Lemper Cooking Competition data structures *2400	0 / 0	9
	981	codeforces#P1725M Moving Both Hands dp graphs shortest paths *1800	0 / 0	6
	980	codeforces#P1726A Mainak and Array greedy math *900	0 / 0	3
	979	codeforces#P1726B Mainak and Interesting Sequence bitmasks constructive algorithms math *1100	0 / 0	3
	978	codeforces#P1726C Jatayu's Balanced Bracket Sequence data structures dsu graphs greedy *1300	0 / 0	4
	977	codeforces#P1726D Edge Split brute force constructive algorithms dfs and similar dsu graphs probabilities trees *2000	0 / 0	7
	976	codeforces#P1726E Almost Perfect combinatorics fft math *2400	0 / 0	9
	975	codeforces#P1726F Late For Work (submissions are not allowed) data structures greedy schedules shortest paths *2900	0 / 0	10
	974	codeforces#P1726G A Certain Magical Party combinatorics data structures greedy sortings *3300	0 / 0	10
	973	codeforces#P1726H Mainak and the Bleeding Polygon binary search geometry implementation math *3500	0 / 0	10
	972	codeforces#P1728A Colored Balls: Revisited brute force greedy implementation sortings *800	0 / 0	3
	971	codeforces#P1728B Best Permutation constructive algorithms greedy *800	0 / 0	3
	970	codeforces#P1728C Digital Logarithm data structures greedy sortings *1400	0 / 0	4
	969	codeforces#P1728D Letter Picking constructive algorithms dp games two pointers *1800	0 / 0	6
	968	codeforces#P1728E Red-Black Pepper brute force data structures greedy math number theory *2300	0 / 0	8
	967	codeforces#P1728F Fishermen flows graph matchings greedy *3100	0 / 0	10
	966	codeforces#P1728G Illumination binary search bitmasks brute force combinatorics dp math two pointers *2700	0 / 0	10
	965	codeforces#P1729A Two Elevators math *800	0 / 0	3
	964	codeforces#P1729B Decode String greedy strings *800	0 / 0	3
	963	codeforces#P1729C Jumping on Tiles constructive algorithms strings *1100	0 / 0	3
	962	codeforces#P1729D Friends and the Restaurant greedy sortings two pointers *1200	0 / 0	4
	961	codeforces#P1729E Guess the Cycle Size interactive probabilities *1800	0 / 0	6
	960	codeforces#P1729F Kirei and the Linear Function hashing math *1900	0 / 0	6
	959	codeforces#P1729G Cut Substrings combinatorics dp hashing strings two pointers *2100	0 / 0	7
	958	codeforces#P1730A Planets data structures greedy sortings *800	0 / 0	3
	957	codeforces#P1730B Meeting on the Line binary search geometry greedy implementation math ternary search *1600	0 / 0	5

Pick a problem randomly based on the current filter.