Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3184	P1310E Strange Function dp *2900	0 / 0	10
	3183	P1310F Bad Cryptography math number theory *3400	0 / 0	10
	3182	P1311A Add Odd or Subtract Even greedy implementation math *800	0 / 0	3
	3181	P1311B WeirdSort dfs and similar sortings *1200	0 / 0	4
	3180	P1311C Perform the Combo brute force *1300	0 / 0	4
	3179	P1311D Three Integers brute force math *2000	0 / 0	7
	3178	P1311E Construct the Binary Tree brute force constructive algorithms trees *2200	0 / 0	8
	3177	P1311F Moving Points data structures divide and conquer implementation sortings *1900	0 / 0	6
	3176	P1312A Two Regular Polygons geometry greedy math number theory *800	0 / 0	3
	3175	P1312B Bogosort constructive algorithms sortings *1000	0 / 0	3
	3174	P1312C Adding Powers bitmasks greedy implementation math number theory ternary search *1400	0 / 0	4
	3173	P1312D Count the Arrays combinatorics math *1700	0 / 0	5
	3172	P1312E Array Shrinking dp greedy *2100	0 / 0	7
	3171	P1312F Attack on Red Kingdom games two pointers *2500	0 / 0	9
	3170	P1312G Autocompletion data structures dfs and similar dp *2600	0 / 0	10
	3169	P1313A Fast Food Restaurant brute force greedy implementation *900	0 / 0	3
	3168	P1313B Different Rules constructive algorithms greedy implementation math *1700	0 / 0	5
	3167	P1313C1 Skyscrapers (easy version) brute force data structures dp greedy *1500	0 / 0	5
	3166	P1313C2 Skyscrapers (hard version) data structures dp greedy *1900	0 / 0	6
	3165	P1313D Happy New Year bitmasks dp implementation *2500	0 / 0	9
	3164	P1313E Concatenation with intersection data structures hashing strings two pointers *2700	0 / 0	10
	3163	P1315A Dead Pixel implementation *800	0 / 0	3
	3162	P1315B Homecoming binary search dp greedy strings *1300	0 / 0	4
	3161	P1315C Restoring Permutation greedy *1200	0 / 0	4
	3160	P1316A Grade Allocation implementation *800	0 / 0	3
	3159	P1316B String Modification brute force constructive algorithms implementation sortings strings *1400	0 / 0	4
	3158	P1316C Primitive Primes constructive algorithms math ternary search *1800	0 / 0	6
	3157	P1316D Nash Matrix constructive algorithms dfs and similar graphs implementation *2000	0 / 0	7
	3156	P1316E Team Building bitmasks dp greedy sortings *2300	0 / 0	8
	3155	P1316F Battalion Strength data structures divide and conquer probabilities *2800	0 / 0	10
	3154	P1320A Journey Planning data structures dp greedy math sortings *1400	0 / 0	4
	3153	P1320B Navigation System dfs and similar graphs shortest paths *1700	0 / 0	5
	3152	P1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	7
	3151	P1320D Reachable Strings data structures hashing strings *2500	0 / 0	9
	3150	P1320E Treeland and Viruses data structures dfs and similar dp shortest paths trees *3000	0 / 0	10
	3149	P1320F Blocks and Sensors brute force *3500	0 / 0	10
	3148	P1321A Contest for Robots greedy *900	0 / 0	3
	3147	P1321C Remove Adjacent brute force constructive algorithms greedy strings *1600	0 / 0	5
	3146	P1322A Unusual Competitions greedy *1300	0 / 0	4
	3145	P1322B Present binary search bitmasks constructive algorithms data structures math sortings *2100	0 / 0	7
	3144	P1322C Instant Noodles graphs hashing math number theory *2300	0 / 0	8
	3143	P1322D Reality Show bitmasks dp *2800	0 / 0	10
	3142	P1322E Median Mountain Range data structures *3300	0 / 0	10
	3141	P1322F Assigning Fares dp trees *3500	0 / 0	10
	3140	P1323A Even Subset Sum Problem brute force dp greedy implementation *800	0 / 0	3
	3139	P1323B Count Subrectangles binary search greedy implementation *1500	0 / 0	5
	3138	P1324A Yet Another Tetris Problem implementation number theory *900	0 / 0	3
	3137	P1324B Yet Another Palindrome Problem brute force strings *1100	0 / 0	3
	3136	P1324C Frog Jumps binary search data structures dfs and similar greedy implementation *1100	0 / 0	3
	3135	P1324D Pair of Topics binary search data structures sortings two pointers *1400	0 / 0	4
	3134	P1324E Sleeping Schedule dp implementation *1700	0 / 0	5
	3133	P1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	6
	3132	P1325A EhAb AnD gCd constructive algorithms greedy number theory *800	0 / 0	3
	3131	P1325B CopyCopyCopyCopyCopy greedy implementation *800	0 / 0	3
	3130	P1325C Ehab and Path-etic MEXs constructive algorithms dfs and similar greedy trees *1500	0 / 0	5
	3129	P1325D Ehab the Xorcist bitmasks constructive algorithms greedy number theory *1700	0 / 0	5
	3128	P1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	0 / 0	10
	3127	P1325F Ehab's Last Theorem constructive algorithms dfs and similar graphs greedy *2500	0 / 0	9
	3126	P1326A Bad Ugly Numbers constructive algorithms number theory *1000	0 / 0	3
	3125	P1326B Maximums implementation math *900	0 / 0	3
	3124	P1326C Permutation Partitions combinatorics greedy math *1300	0 / 0	4
	3123	P1326D1 Prefix-Suffix Palindrome (Easy version) hashing string suffix structures strings *1500	0 / 0	5
	3122	P1326D2 Prefix-Suffix Palindrome (Hard version) binary search greedy hashing string suffix structures strings *1800	0 / 0	6
	3121	P1326E Bombs data structures two pointers *2400	0 / 0	9
	3120	P1326F1 Wise Men (Easy Version) bitmasks brute force dp meet-in-the-middle *2600	0 / 0	10
	3119	P1326F2 Wise Men (Hard Version) bitmasks dp math *3200	0 / 0	10
	3118	P1326G Spiderweb Trees dp geometry trees *3500	0 / 0	10
	3117	P1327A Sum of Odd Integers math *1100	0 / 0	3
	3116	P1327B Princesses and Princes brute force graphs greedy *1200	0 / 0	4
	3115	P1327C Game with Chips constructive algorithms implementation *1600	0 / 0	5
	3114	P1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	8
	3113	P1327E Count The Blocks combinatorics dp math *1800	0 / 0	6
	3112	P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	9
	3111	P1327G Letters and Question Marks bitmasks dp string suffix structures *2800	0 / 0	10
	3110	P1328A Divisibility Problem math *800	0 / 0	3
	3109	P1328B K-th Beautiful String binary search brute force combinatorics implementation math *1300	0 / 0	4
	3108	P1328C Ternary XOR greedy implementation *1200	0 / 0	4
	3107	P1328D Carousel constructive algorithms dp graphs greedy math *1800	0 / 0	6
	3106	P1328E Tree Queries dfs and similar graphs trees *1900	0 / 0	6
	3105	P1328F Make k Equal greedy *2200	0 / 0	8
	3104	P1329A Dreamoon Likes Coloring constructive algorithms greedy implementation math *1800	0 / 0	6
	3103	P1329B Dreamoon Likes Sequences bitmasks combinatorics math *1700	0 / 0	5
	3102	P1329C Drazil Likes Heap constructive algorithms data structures greedy implementation *2400	0 / 0	9
	3101	P1329D Dreamoon Likes Strings constructive algorithms data structures *3100	0 / 0	10
	3100	P1329E Dreamoon Loves AA binary search greedy *3300	0 / 0	10
	3099	P1330A Dreamoon and Ranking Collection implementation *900	0 / 0	3
	3098	P1330B Dreamoon Likes Permutations implementation math *1400	0 / 0	4
	3097	P1331A Is it rated? *special problem	0 / 0	(None)
	3096	P1331B Limericks *special problem math number theory	0 / 0	(None)
	3095	P1331C ...And after happily lived ever they *special problem bitmasks	0 / 0	(None)
	3094	P1331D Again? *special problem implementation	0 / 0	(None)
	3093	P1331E Jordan Smiley *special problem dfs and similar geometry implementation	0 / 0	(None)
	3092	P1331F Elementary! *special problem brute force dp strings	0 / 0	(None)
	3091	P1331G Lingua Romana *special problem	0 / 0	(None)
	3090	P1331H It's showtime *special problem	0 / 0	(None)
	3089	P1332A Exercising Walk greedy implementation math *1100	0 / 0	3
	3088	P1332B Composite Coloring brute force constructive algorithms greedy math number theory *1400	0 / 0	4
	3087	P1332C K-Complete Word dfs and similar dsu greedy implementation strings *1500	0 / 0	5
	3086	P1332D Walk on Matrix bitmasks constructive algorithms math *1700	0 / 0	5
	3085	P1332E Height All the Same combinatorics constructive algorithms math matrices *2100	0 / 0	7

Pick a problem randomly based on the current filter.