Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3156	codeforces#P1316E Team Building bitmasks dp greedy sortings *2300	0 / 0	8
	3155	codeforces#P1316F Battalion Strength data structures divide and conquer probabilities *2800	0 / 0	10
	3154	codeforces#P1320A Journey Planning data structures dp greedy math sortings *1400	0 / 0	4
	3153	codeforces#P1320B Navigation System dfs and similar graphs shortest paths *1700	0 / 0	5
	3152	codeforces#P1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	7
	3151	codeforces#P1320D Reachable Strings data structures hashing strings *2500	0 / 0	9
	3150	codeforces#P1320E Treeland and Viruses data structures dfs and similar dp shortest paths trees *3000	0 / 0	10
	3149	codeforces#P1320F Blocks and Sensors brute force *3500	0 / 0	10
	3148	codeforces#P1321A Contest for Robots greedy *900	0 / 0	3
	3147	codeforces#P1321C Remove Adjacent brute force constructive algorithms greedy strings *1600	0 / 0	5
	3146	codeforces#P1322A Unusual Competitions greedy *1300	0 / 0	4
	3145	codeforces#P1322B Present binary search bitmasks constructive algorithms data structures math sortings *2100	0 / 0	7
	3144	codeforces#P1322C Instant Noodles graphs hashing math number theory *2300	0 / 0	8
	3143	codeforces#P1322D Reality Show bitmasks dp *2800	0 / 0	10
	3142	codeforces#P1322E Median Mountain Range data structures *3300	0 / 0	10
	3141	codeforces#P1322F Assigning Fares dp trees *3500	0 / 0	10
	3140	codeforces#P1323A Even Subset Sum Problem brute force dp greedy implementation *800	0 / 0	3
	3139	codeforces#P1323B Count Subrectangles binary search greedy implementation *1500	0 / 0	5
	3138	codeforces#P1324A Yet Another Tetris Problem implementation number theory *900	0 / 0	3
	3137	codeforces#P1324B Yet Another Palindrome Problem brute force strings *1100	0 / 0	3
	3136	codeforces#P1324C Frog Jumps binary search data structures dfs and similar greedy implementation *1100	0 / 0	3
	3135	codeforces#P1324D Pair of Topics binary search data structures sortings two pointers *1400	0 / 0	4
	3134	codeforces#P1324E Sleeping Schedule dp implementation *1700	0 / 0	5
	3133	codeforces#P1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	6
	3132	codeforces#P1325A EhAb AnD gCd constructive algorithms greedy number theory *800	0 / 0	3
	3131	codeforces#P1325B CopyCopyCopyCopyCopy greedy implementation *800	0 / 0	3
	3130	codeforces#P1325C Ehab and Path-etic MEXs constructive algorithms dfs and similar greedy trees *1500	0 / 0	5
	3129	codeforces#P1325D Ehab the Xorcist bitmasks constructive algorithms greedy number theory *1700	0 / 0	5
	3128	codeforces#P1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	0 / 0	10
	3127	codeforces#P1325F Ehab's Last Theorem constructive algorithms dfs and similar graphs greedy *2500	0 / 0	9
	3126	codeforces#P1326A Bad Ugly Numbers constructive algorithms number theory *1000	0 / 0	3
	3125	codeforces#P1326B Maximums implementation math *900	0 / 0	3
	3124	codeforces#P1326C Permutation Partitions combinatorics greedy math *1300	0 / 0	4
	3123	codeforces#P1326D1 Prefix-Suffix Palindrome (Easy version) hashing string suffix structures strings *1500	0 / 0	5
	3122	codeforces#P1326D2 Prefix-Suffix Palindrome (Hard version) binary search greedy hashing string suffix structures strings *1800	0 / 0	6
	3121	codeforces#P1326E Bombs data structures two pointers *2400	0 / 0	9
	3120	codeforces#P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	10
	3119	codeforces#P1326F2 Wise Men (Hard Version) bitmasks dp math *3200	0 / 0	10
	3118	codeforces#P1326G Spiderweb Trees dp geometry trees *3500	0 / 0	10
	3117	codeforces#P1327A Sum of Odd Integers math *1100	0 / 0	3
	3116	codeforces#P1327B Princesses and Princes brute force graphs greedy *1200	0 / 0	4
	3115	codeforces#P1327C Game with Chips constructive algorithms implementation *1600	0 / 0	5
	3114	codeforces#P1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	8
	3113	codeforces#P1327E Count The Blocks combinatorics dp math *1800	0 / 0	6
	3112	codeforces#P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	9
	3111	codeforces#P1327G Letters and Question Marks bitmasks dp string suffix structures *2800	0 / 0	10
	3110	codeforces#P1328A Divisibility Problem math *800	0 / 0	3
	3109	codeforces#P1328B K-th Beautiful String binary search brute force combinatorics implementation math *1300	0 / 0	4
	3108	codeforces#P1328C Ternary XOR greedy implementation *1200	0 / 0	4
	3107	codeforces#P1328D Carousel constructive algorithms dp graphs greedy math *1800	0 / 0	6
	3106	codeforces#P1328E Tree Queries dfs and similar graphs trees *1900	0 / 0	6
	3105	codeforces#P1328F Make k Equal greedy *2200	0 / 0	8
	3104	codeforces#P1329A Dreamoon Likes Coloring constructive algorithms greedy implementation math *1800	0 / 0	6
	3103	codeforces#P1329B Dreamoon Likes Sequences bitmasks combinatorics math *1700	0 / 0	5
	3102	codeforces#P1329C Drazil Likes Heap constructive algorithms data structures greedy implementation *2400	0 / 0	9
	3101	codeforces#P1329D Dreamoon Likes Strings constructive algorithms data structures *3100	0 / 0	10
	3100	codeforces#P1329E Dreamoon Loves AA binary search greedy *3300	0 / 0	10
	3099	codeforces#P1330A Dreamoon and Ranking Collection implementation *900	0 / 0	3
	3098	codeforces#P1330B Dreamoon Likes Permutations implementation math *1400	0 / 0	4
	3097	codeforces#P1331A Is it rated? *special problem	0 / 0	(None)
	3096	codeforces#P1331B Limericks *special problem math number theory	0 / 0	(None)
	3095	codeforces#P1331C ...And after happily lived ever they *special problem bitmasks	0 / 0	(None)
	3094	codeforces#P1331D Again? *special problem implementation	0 / 0	(None)
	3093	codeforces#P1331E Jordan Smiley *special problem dfs and similar geometry implementation	0 / 0	(None)
	3092	codeforces#P1331F Elementary! *special problem brute force dp strings	0 / 0	(None)
	3091	codeforces#P1331G Lingua Romana *special problem	0 / 0	(None)
	3090	codeforces#P1331H It's showtime *special problem	0 / 0	(None)
	3089	codeforces#P1332A Exercising Walk greedy implementation math *1100	0 / 0	3
	3088	codeforces#P1332B Composite Coloring brute force constructive algorithms greedy math number theory *1400	0 / 0	4
	3087	codeforces#P1332C K-Complete Word dfs and similar dsu greedy implementation strings *1500	0 / 0	5
	3086	codeforces#P1332D Walk on Matrix bitmasks constructive algorithms math *1700	0 / 0	5
	3085	codeforces#P1332E Height All the Same combinatorics constructive algorithms math matrices *2100	0 / 0	7
	3084	codeforces#P1332F Independent Set dfs and similar dp trees *2500	0 / 0	9
	3083	codeforces#P1332G No Monotone Triples data structures *3100	0 / 0	10
	3082	codeforces#P1333A Little Artem constructive algorithms *1000	0 / 0	3
	3081	codeforces#P1333B Kind Anton greedy implementation *1100	0 / 0	3
	3080	codeforces#P1333C Eugene and an array binary search data structures implementation two pointers *1700	0 / 0	5
	3079	codeforces#P1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	7
	3078	codeforces#P1333E Road to 1600 brute force constructive algorithms *2400	0 / 0	9
	3077	codeforces#P1333F Kate and imperfection greedy implementation math number theory sortings two pointers *2200	0 / 0	8
	3076	codeforces#P1334A Level Statistics implementation math *1200	0 / 0	4
	3075	codeforces#P1334B Middle Class greedy sortings *1100	0 / 0	3
	3074	codeforces#P1334C Circle of Monsters brute force constructive algorithms greedy math *1600	0 / 0	5
	3073	codeforces#P1334D Minimum Euler Cycle constructive algorithms graphs greedy implementation *1800	0 / 0	6
	3072	codeforces#P1334E Divisor Paths combinatorics graphs greedy math number theory *2200	0 / 0	8
	3071	codeforces#P1334F Strange Function binary search data structures dp greedy *2500	0 / 0	9
	3070	codeforces#P1334G Substring Search bitmasks brute force fft *2900	0 / 0	10
	3069	codeforces#P1335A Candies and Two Sisters math *800	0 / 0	3
	3068	codeforces#P1335B Construct the String constructive algorithms *900	0 / 0	3
	3067	codeforces#P1335C Two Teams Composing binary search greedy implementation sortings *1100	0 / 0	3
	3066	codeforces#P1335D Anti-Sudoku constructive algorithms implementation *1300	0 / 0	4
	3065	codeforces#P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	5
	3064	codeforces#P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	6
	3063	codeforces#P1335F Robots on a Grid data structures dfs and similar dsu graphs greedy matrices *2200	0 / 0	8
	3062	codeforces#P1336A Linova and Kingdom dfs and similar dp greedy sortings trees *1600	0 / 0	5
	3061	codeforces#P1336B Xenia and Colorful Gems binary search greedy math sortings two pointers *1700	0 / 0	5
	3060	codeforces#P1336C Kaavi and Magic Spell dp strings *2200	0 / 0	8
	3059	codeforces#P1336D Yui and Mahjong Set constructive algorithms interactive *3200	0 / 0	10
	3058	codeforces#P1336E1 Chiori and Doll Picking (easy version) bitmasks brute force combinatorics math *2700	0 / 0	10
	3057	codeforces#P1336E2 Chiori and Doll Picking (hard version) bitmasks brute force combinatorics math *3500	0 / 0	10

Pick a problem randomly based on the current filter.