Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3256	codeforces#P1296A Array with Odd Sum math *800	0 / 0	3
	3255	codeforces#P1296B Food Buying math *900	0 / 0	3
	3254	codeforces#P1296C Yet Another Walking Robot data structures implementation *1500	0 / 0	5
	3253	codeforces#P1296D Fight with Monsters greedy sortings *1500	0 / 0	5
	3252	codeforces#P1296E1 String Coloring (easy version) constructive algorithms dp graphs greedy sortings *1800	0 / 0	6
	3251	codeforces#P1296E2 String Coloring (hard version) data structures dp *2000	0 / 0	7
	3250	codeforces#P1296F Berland Beauty constructive algorithms dfs and similar greedy sortings trees *2100	0 / 0	7
	3249	codeforces#P1297A Likes Display *special problem implementation	0 / 0	(None)
	3248	codeforces#P1297B Cartoons *special problem implementation sortings	0 / 0	(None)
	3247	codeforces#P1297C Dream Team *special problem greedy	0 / 0	(None)
	3246	codeforces#P1297D Bonus Distribution *special problem binary search greedy sortings	0 / 0	(None)
	3245	codeforces#P1297E Modernization of Treeland *special problem dfs and similar trees	0 / 0	(None)
	3244	codeforces#P1297F Movie Fan *special problem data structures greedy implementation sortings	0 / 0	(None)
	3243	codeforces#P1297G M-numbers *special problem dp math	0 / 0	(None)
	3242	codeforces#P1297H Paint the String *special problem dp strings	0 / 0	(None)
	3241	codeforces#P1297I Falling Blocks *special problem data structures	0 / 0	(None)
	3240	codeforces#P1299A Anu Has a Function brute force greedy math *1500	0 / 0	5
	3239	codeforces#P1299B Aerodynamic geometry *1800	0 / 0	6
	3238	codeforces#P1299C Water Balance data structures geometry greedy *2100	0 / 0	7
	3237	codeforces#P1299D Around the World bitmasks combinatorics dfs and similar dp graphs graphs math trees *3000	0 / 0	10
	3236	codeforces#P1299E So Mean interactive math *3400	0 / 0	10
	3235	codeforces#P1300A Non-zero implementation math *800	0 / 0	3
	3234	codeforces#P1300B Assigning to Classes greedy implementation sortings *1000	0 / 0	3
	3233	codeforces#P1301A Three Strings implementation strings *800	0 / 0	3
	3232	codeforces#P1301B Motarack's Birthday binary search greedy ternary search *1500	0 / 0	5
	3231	codeforces#P1301C Ayoub's function binary search combinatorics greedy math strings *1700	0 / 0	5
	3230	codeforces#P1301D Time to Run constructive algorithms graphs implementation *2000	0 / 0	7
	3229	codeforces#P1301E Nanosoft binary search data structures dp implementation *2500	0 / 0	9
	3228	codeforces#P1301F Super Jaber dfs and similar graphs implementation shortest paths *2600	0 / 0	10
	3227	codeforces#P1302A Nash equilibrium	0 / 0	(None)
	3226	codeforces#P1302B DAG constructive algorithms	0 / 0	(None)
	3225	codeforces#P1302C Segment tree or Fenwick? data structures	0 / 0	(None)
	3224	codeforces#P1302D Dijkstra	0 / 0	(None)
	3223	codeforces#P1302E Amazing bitset	0 / 0	(None)
	3222	codeforces#P1302F Keep talking and nobody explodes – easy bitmasks brute force expression parsing	0 / 0	(None)
	3221	codeforces#P1302G Keep talking and nobody explodes – medium	0 / 0	(None)
	3220	codeforces#P1302H Who needs suffix structures?	0 / 0	(None)
	3219	codeforces#P1302I Deja vu	0 / 0	(None)
	3218	codeforces#P1302J Keep talking and nobody explodes – hard	0 / 0	(None)
	3217	codeforces#P1303A Erasing Zeroes implementation strings *800	0 / 0	3
	3216	codeforces#P1303B National Project math *1400	0 / 0	4
	3215	codeforces#P1303C Perfect Keyboard dfs and similar greedy implementation *1600	0 / 0	5
	3214	codeforces#P1303D Fill The Bag bitmasks greedy *1900	0 / 0	6
	3213	codeforces#P1303E Erase Subsequences dp strings *2200	0 / 0	8
	3212	codeforces#P1303F Number of Components dsu implementation *2800	0 / 0	10
	3211	codeforces#P1303G Sum of Prefix Sums data structures divide and conquer geometry trees *2700	0 / 0	10
	3210	codeforces#P1304A Two Rabbits math *800	0 / 0	3
	3209	codeforces#P1304B Longest Palindrome brute force constructive algorithms greedy implementation strings *1100	0 / 0	3
	3208	codeforces#P1304C Air Conditioner dp greedy implementation sortings two pointers *1500	0 / 0	5
	3207	codeforces#P1304D Shortest and Longest LIS constructive algorithms graphs greedy two pointers *1800	0 / 0	6
	3206	codeforces#P1304E 1-Trees and Queries data structures dfs and similar shortest paths trees *2000	0 / 0	7
	3205	codeforces#P1304F1 Animal Observation (easy version) data structures dp *2300	0 / 0	8
	3204	codeforces#P1304F2 Animal Observation (hard version) data structures dp greedy *2400	0 / 0	9
	3203	codeforces#P1305A Kuroni and the Gifts brute force constructive algorithms greedy sortings *800	0 / 0	3
	3202	codeforces#P1305B Kuroni and Simple Strings constructive algorithms greedy strings two pointers *1200	0 / 0	4
	3201	codeforces#P1305C Kuroni and Impossible Calculation brute force combinatorics math number theory *1600	0 / 0	5
	3200	codeforces#P1305D Kuroni and the Celebration constructive algorithms dfs and similar interactive trees *1900	0 / 0	6
	3199	codeforces#P1305E Kuroni and the Score Distribution constructive algorithms greedy implementation math *2200	0 / 0	8
	3198	codeforces#P1305F Kuroni and the Punishment math number theory probabilities *2500	0 / 0	9
	3197	codeforces#P1305G Kuroni and Antihype bitmasks brute force dp dsu graphs *3500	0 / 0	10
	3196	codeforces#P1305H Kuroni the Private Tutor binary search greedy *3500	0 / 0	10
	3195	codeforces#P1307A Cow and Haybales greedy implementation *800	0 / 0	3
	3194	codeforces#P1307B Cow and Friend geometry greedy math *1300	0 / 0	4
	3193	codeforces#P1307C Cow and Message brute force dp math strings *1500	0 / 0	5
	3192	codeforces#P1307D Cow and Fields binary search data structures dfs and similar graphs greedy shortest paths sortings *1900	0 / 0	6
	3191	codeforces#P1307E Cow and Treats binary search combinatorics dp greedy implementation math *2500	0 / 0	9
	3190	codeforces#P1307F Cow and Vacation dfs and similar dsu trees *3300	0 / 0	10
	3189	codeforces#P1307G Cow and Exercise flows graphs shortest paths *3100	0 / 0	10
	3188	codeforces#P1310A Recommendations data structures greedy sortings *1700	0 / 0	5
	3187	codeforces#P1310B Double Elimination dp implementation *2500	0 / 0	9
	3186	codeforces#P1310C Au Pont Rouge binary search dp strings *2800	0 / 0	10
	3185	codeforces#P1310D Tourism dp graphs probabilities *2300	0 / 0	8
	3184	codeforces#P1310E Strange Function dp *2900	0 / 0	10
	3183	codeforces#P1310F Bad Cryptography math number theory *3400	0 / 0	10
	3182	codeforces#P1311A Add Odd or Subtract Even greedy implementation math *800	0 / 0	3
	3181	codeforces#P1311B WeirdSort dfs and similar sortings *1200	0 / 0	4
	3180	codeforces#P1311C Perform the Combo brute force *1300	0 / 0	4
	3179	codeforces#P1311D Three Integers brute force math *2000	0 / 0	7
	3178	codeforces#P1311E Construct the Binary Tree brute force constructive algorithms trees *2200	0 / 0	8
	3177	codeforces#P1311F Moving Points data structures divide and conquer implementation sortings *1900	0 / 0	6
	3176	codeforces#P1312A Two Regular Polygons geometry greedy math number theory *800	0 / 0	3
	3175	codeforces#P1312B Bogosort constructive algorithms sortings *1000	0 / 0	3
	3174	codeforces#P1312C Adding Powers bitmasks greedy implementation math number theory ternary search *1400	0 / 0	4
	3173	codeforces#P1312D Count the Arrays combinatorics math *1700	0 / 0	5
	3172	codeforces#P1312E Array Shrinking dp greedy *2100	0 / 0	7
	3171	codeforces#P1312F Attack on Red Kingdom games two pointers *2500	0 / 0	9
	3170	codeforces#P1312G Autocompletion data structures dfs and similar dp *2600	0 / 0	10
	3169	codeforces#P1313A Fast Food Restaurant brute force greedy implementation *900	0 / 0	3
	3168	codeforces#P1313B Different Rules constructive algorithms greedy implementation math *1700	0 / 0	5
	3167	codeforces#P1313C1 Skyscrapers (easy version) brute force data structures dp greedy *1500	0 / 0	5
	3166	codeforces#P1313C2 Skyscrapers (hard version) data structures dp greedy *1900	0 / 0	6
	3165	codeforces#P1313D Happy New Year bitmasks dp implementation *2500	0 / 0	9
	3164	codeforces#P1313E Concatenation with intersection data structures hashing strings two pointers *2700	0 / 0	10
	3163	codeforces#P1315A Dead Pixel implementation *800	0 / 0	3
	3162	codeforces#P1315B Homecoming binary search dp greedy strings *1300	0 / 0	4
	3161	codeforces#P1315C Restoring Permutation greedy *1200	0 / 0	4
	3160	codeforces#P1316A Grade Allocation implementation *800	0 / 0	3
	3159	codeforces#P1316B String Modification brute force constructive algorithms implementation sortings strings *1400	0 / 0	4
	3158	codeforces#P1316C Primitive Primes constructive algorithms math ternary search *1800	0 / 0	6
	3157	codeforces#P1316D Nash Matrix constructive algorithms dfs and similar graphs implementation *2000	0 / 0	7

Pick a problem randomly based on the current filter.