Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3384	P1267K Key Storage combinatorics math *2100	0 / 0	7
	3383	P1267L Lexicography constructive algorithms strings *1800	0 / 0	6
	3382	P1268A Long Beautiful Integer constructive algorithms greedy implementation strings *1700	0 / 0	5
	3381	P1268B Domino for Young dp greedy math *2000	0 / 0	7
	3380	P1268C K Integers binary search data structures *2300	0 / 0	8
	3379	P1268D Invertation in Tournament brute force divide and conquer graphs math *3200	0 / 0	10
	3378	P1268E Happy Cactus dp *3400	0 / 0	10
	3377	P1269A Equation brute force math *800	0 / 0	3
	3376	P1269B Modulo Equality brute force sortings *1500	0 / 0	5
	3375	P1270A Card Game games greedy math *800	0 / 0	3
	3374	P1270B Interesting Subarray constructive algorithms greedy math *1200	0 / 0	4
	3373	P1270C Make Good bitmasks constructive algorithms math *1400	0 / 0	4
	3372	P1270D Strange Device constructive algorithms interactive math sortings *1900	0 / 0	6
	3371	P1270E Divide Points constructive algorithms geometry math *2300	0 / 0	8
	3370	P1270F Awesome Substrings math strings *2600	0 / 0	10
	3369	P1270G Subset with Zero Sum constructive algorithms dfs and similar graphs math *2700	0 / 0	10
	3368	P1270H Number of Components data structures *3300	0 / 0	10
	3367	P1270I Xor on Figures constructive algorithms fft math *3500	0 / 0	10
	3366	P1271A Suits brute force greedy math *800	0 / 0	3
	3365	P1271B Blocks greedy math *1300	0 / 0	4
	3364	P1271C Shawarma Tent brute force geometry greedy implementation *1300	0 / 0	4
	3363	P1271D Portals data structures dp greedy implementation sortings *2100	0 / 0	7
	3362	P1271E Common Number binary search combinatorics dp math *2100	0 / 0	7
	3361	P1271F Divide The Students brute force *2700	0 / 0	10
	3360	P1272A Three Friends brute force greedy math sortings *900	0 / 0	3
	3359	P1272B Snow Walking Robot constructive algorithms greedy implementation *1200	0 / 0	4
	3358	P1272C Yet Another Broken Keyboard combinatorics dp implementation *1200	0 / 0	4
	3357	P1272D Remove One Element brute force dp *1500	0 / 0	5
	3356	P1272E Nearest Opposite Parity dfs and similar graphs shortest paths *1900	0 / 0	6
	3355	P1272F Two Bracket Sequences dp strings two pointers *2200	0 / 0	8
	3354	P1276A As Simple as One and Two dp greedy *1400	0 / 0	4
	3353	P1276B Two Fairs combinatorics dfs and similar dsu graphs *1900	0 / 0	6
	3352	P1276C Beautiful Rectangle brute force combinatorics constructive algorithms data structures greedy math *2300	0 / 0	8
	3351	P1276D Tree Elimination dp trees *2900	0 / 0	10
	3350	P1276E Four Stones constructive algorithms *3500	0 / 0	10
	3349	P1276F Asterisk Substrings string suffix structures *3400	0 / 0	10
	3348	P1277A Happy Birthday, Polycarp! implementation *1000	0 / 0	3
	3347	P1277B Make Them Odd greedy number theory *1200	0 / 0	4
	3346	P1277D Let's Play the Words? data structures hashing implementation math *1900	0 / 0	6
	3345	P1278A Shuffle Hashing brute force implementation strings *1000	0 / 0	3
	3344	P1278B A and B greedy math *1500	0 / 0	5
	3343	P1278C Berry Jam data structures dp greedy implementation *1700	0 / 0	5
	3342	P1278D Segment Tree data structures dsu graphs trees *2100	0 / 0	7
	3341	P1278E Tests for problem D constructive algorithms dfs and similar divide and conquer trees *2200	0 / 0	8
	3340	P1278F Cards combinatorics dp math number theory probabilities *2600	0 / 0	10
	3339	P1279A New Year Garland math *900	0 / 0	3
	3338	P1279B Verse For Santa binary search brute force implementation *1300	0 / 0	4
	3337	P1279C Stack of Presents data structures implementation *1400	0 / 0	4
	3336	P1279D Santa's Bot combinatorics math probabilities *1700	0 / 0	5
	3335	P1279E New Year Permutations combinatorics dp *2700	0 / 0	10
	3334	P1279F New Year and Handle Change binary search dp *2800	0 / 0	10
	3333	P1280A Cut and Paste implementation math *1700	0 / 0	5
	3332	P1280B Beingawesomeism implementation math *1800	0 / 0	6
	3331	P1280C Jeremy Bearimy dfs and similar graphs greedy trees *2000	0 / 0	7
	3330	P1280D Miss Punyverse dp greedy trees *2500	0 / 0	9
	3329	P1280E Kirchhoff's Current Loss math *2900	0 / 0	10
	3328	P1280F Intergalactic Sliding Puzzle combinatorics constructive algorithms math *3400	0 / 0	10
	3327	P1281A Suffix Three implementation *800	0 / 0	3
	3326	P1281B Azamon Web Services greedy *1600	0 / 0	5
	3325	P1282A Temporarily unavailable implementation math *900	0 / 0	3
	3324	P1282B1 K for the Price of One (Easy Version) dp greedy sortings *1400	0 / 0	4
	3323	P1282B2 K for the Price of One (Hard Version) dp greedy sortings *1600	0 / 0	5
	3322	P1282C Petya and Exam greedy sortings two pointers *1800	0 / 0	6
	3321	P1282D Enchanted Artifact constructive algorithms interactive strings *2300	0 / 0	8
	3320	P1282E The Cake Is a Lie constructive algorithms data structures dfs and similar graphs *2400	0 / 0	9
	3319	P1283A Minutes Before the New Year math *800	0 / 0	3
	3318	P1283B Candies Division math *900	0 / 0	3
	3317	P1283C Friends and Gifts constructive algorithms data structures math *1500	0 / 0	5
	3316	P1283D Christmas Trees graphs greedy shortest paths *1800	0 / 0	6
	3315	P1283E New Year Parties dp greedy *1800	0 / 0	6
	3314	P1283F DIY Garland constructive algorithms greedy trees *2200	0 / 0	8
	3313	P1284A New Year and Naming implementation strings *800	0 / 0	3
	3312	P1284B New Year and Ascent Sequence binary search combinatorics data structures dp implementation sortings *1400	0 / 0	4
	3311	P1284C New Year and Permutation combinatorics math *1600	0 / 0	5
	3310	P1284D New Year and Conference binary search data structures hashing sortings *2100	0 / 0	7
	3309	P1284E New Year and Castle Construction combinatorics geometry math sortings *2500	0 / 0	9
	3308	P1284F New Year and Social Network data structures graph matchings graphs math trees *3200	0 / 0	10
	3307	P1284G Seollal graphs *3300	0 / 0	10
	3306	P1285A Mezo Playing Zoma math *800	0 / 0	3
	3305	P1285B Just Eat It! dp greedy implementation *1300	0 / 0	4
	3304	P1285C Fadi and LCM brute force math number theory *1400	0 / 0	4
	3303	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	6
	3302	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	8
	3301	P1285F Classical? binary search combinatorics number theory *2900	0 / 0	10
	3300	P1286A Garland dp greedy sortings *1800	0 / 0	6
	3299	P1286B Numbers on Tree constructive algorithms data structures dfs and similar graphs greedy trees *1800	0 / 0	6
	3298	P1286C1 Madhouse (Easy version) brute force constructive algorithms interactive math *2400	0 / 0	9
	3297	P1286C2 Madhouse (Hard version) brute force constructive algorithms hashing interactive math *2800	0 / 0	10
	3296	P1286D LCC data structures math matrices probabilities *3100	0 / 0	10
	3295	P1286E Fedya the Potter Strikes Back data structures strings *3200	0 / 0	10
	3294	P1286F Harry The Potter brute force constructive algorithms dp fft implementation math *3100	0 / 0	10
	3293	P1287A Angry Students greedy implementation *800	0 / 0	3
	3292	P1287B Hyperset brute force data structures implementation *1500	0 / 0	5
	3291	P1288A Deadline binary search brute force math ternary search *1100	0 / 0	3
	3290	P1288B Yet Another Meme Problem math *1100	0 / 0	3
	3289	P1288C Two Arrays combinatorics dp *1600	0 / 0	5
	3288	P1288D Minimax Problem binary search bitmasks dp *2000	0 / 0	7
	3287	P1288E Messenger Simulator data structures *2000	0 / 0	7
	3286	P1288F Red-Blue Graph constructive algorithms flows *2900	0 / 0	10
	3285	P1290A Mind Control brute force data structures implementation *1600	0 / 0	5

Pick a problem randomly based on the current filter.