Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3084	P1332F Independent Set dfs and similar dp trees *2500	0 / 0	9
	3083	P1332G No Monotone Triples data structures *3100	0 / 0	10
	3082	P1333A Little Artem constructive algorithms *1000	0 / 0	3
	3081	P1333B Kind Anton greedy implementation *1100	0 / 0	3
	3080	P1333C Eugene and an array binary search data structures implementation two pointers *1700	0 / 0	5
	3079	P1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	7
	3078	P1333E Road to 1600 brute force constructive algorithms *2400	0 / 0	9
	3077	P1333F Kate and imperfection greedy implementation math number theory sortings two pointers *2200	0 / 0	8
	3076	P1334A Level Statistics implementation math *1200	0 / 0	4
	3075	P1334B Middle Class greedy sortings *1100	0 / 0	3
	3074	P1334C Circle of Monsters brute force constructive algorithms greedy math *1600	0 / 0	5
	3073	P1334D Minimum Euler Cycle constructive algorithms graphs greedy implementation *1800	0 / 0	6
	3072	P1334E Divisor Paths combinatorics graphs greedy math number theory *2200	0 / 0	8
	3071	P1334F Strange Function binary search data structures dp greedy *2500	0 / 0	9
	3070	P1334G Substring Search bitmasks brute force fft *2900	0 / 0	10
	3069	P1335A Candies and Two Sisters math *800	0 / 0	3
	3068	P1335B Construct the String constructive algorithms *900	0 / 0	3
	3067	P1335C Two Teams Composing binary search greedy implementation sortings *1100	0 / 0	3
	3066	P1335D Anti-Sudoku constructive algorithms implementation *1300	0 / 0	4
	3065	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	5
	3064	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	6
	3063	P1335F Robots on a Grid data structures dfs and similar dsu graphs greedy matrices *2200	0 / 0	8
	3062	P1336A Linova and Kingdom dfs and similar dp greedy sortings trees *1600	0 / 0	5
	3061	P1336B Xenia and Colorful Gems binary search greedy math sortings two pointers *1700	0 / 0	5
	3060	P1336C Kaavi and Magic Spell dp strings *2200	0 / 0	8
	3059	P1336D Yui and Mahjong Set constructive algorithms interactive *3200	0 / 0	10
	3058	P1336E1 Chiori and Doll Picking (easy version) bitmasks brute force combinatorics math *2700	0 / 0	10
	3057	P1336E2 Chiori and Doll Picking (hard version) bitmasks brute force combinatorics math *3500	0 / 0	10
	3056	P1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	10
	3055	P1337A Ichihime and Triangle constructive algorithms math *800	0 / 0	3
	3054	P1337B Kana and Dragon Quest game greedy implementation math *900	0 / 0	3
	3053	P1338A Powered Addition greedy math *1500	0 / 0	5
	3052	P1338B Edge Weight Assignment bitmasks constructive algorithms dfs and similar greedy math trees *1800	0 / 0	6
	3051	P1338C Perfect Triples bitmasks brute force constructive algorithms divide and conquer math *2200	0 / 0	8
	3050	P1338D Nested Rubber Bands constructive algorithms dfs and similar dp math trees *2700	0 / 0	10
	3049	P1338E JYPnation graphs *3500	0 / 0	10
	3048	P1339A Filling Diamonds brute force dp implementation math *900	0 / 0	3
	3047	P1339B Sorted Adjacent Differences constructive algorithms sortings *1200	0 / 0	4
	3046	P1340A Nastya and Strange Generator brute force data structures greedy implementation *1500	0 / 0	5
	3045	P1340B Nastya and Scoreboard bitmasks dp graphs greedy *1700	0 / 0	5
	3044	P1340C Nastya and Unexpected Guest dfs and similar dp graphs shortest paths *2400	0 / 0	9
	3043	P1340D Nastya and Time Machine constructive algorithms dfs and similar graphs trees *2600	0 / 0	10
	3042	P1340E Nastya and Bees graphs interactive probabilities *3000	0 / 0	10
	3041	P1340F Nastya and CBS brute force data structures hashing *3300	0 / 0	10
	3040	P1341A Nastya and Rice math *900	0 / 0	3
	3039	P1341B Nastya and Door greedy implementation *1300	0 / 0	4
	3038	P1342A Road To Zero greedy math *1000	0 / 0	3
	3037	P1342B Binary Period constructive algorithms strings *1100	0 / 0	3
	3036	P1342C Yet Another Counting Problem math number theory *1600	0 / 0	5
	3035	P1342D Multiple Testcases binary search constructive algorithms data structures greedy sortings two pointers *1900	0 / 0	6
	3034	P1342E Placing Rooks combinatorics fft math *2300	0 / 0	8
	3033	P1342F Make It Ascending bitmasks brute force dp *3000	0 / 0	10
	3032	P1343A Candies brute force math *900	0 / 0	3
	3031	P1343B Balanced Array constructive algorithms math *800	0 / 0	3
	3030	P1343C Alternating Subsequence dp greedy two pointers *1200	0 / 0	4
	3029	P1343D Constant Palindrome Sum brute force data structures greedy two pointers *1700	0 / 0	5
	3028	P1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	7
	3027	P1343F Restore the Permutation by Sorted Segments brute force constructive algorithms data structures greedy implementation *2400	0 / 0	9
	3026	P1344A Hilbert's Hotel math number theory sortings *1600	0 / 0	5
	3025	P1344B Monopole Magnets constructive algorithms dfs and similar dsu graphs *2000	0 / 0	7
	3024	P1344C Quantifier Question dfs and similar dp graphs math *2600	0 / 0	10
	3023	P1344D Résumé Review binary search greedy math *2700	0 / 0	10
	3022	P1344E Train Tracks data structures trees *3100	0 / 0	10
	3021	P1344F Piet's Palette matrices *3200	0 / 0	10
	3020	P1345A Puzzle Pieces math *800	0 / 0	3
	3019	P1345B Card Constructions binary search brute force dp math *1100	0 / 0	3
	3018	P1346A Color Revolution special problem math 1000	0 / 0	3
	3017	P1346B Boot Camp special problem greedy 1400	0 / 0	4
	3016	P1346C Spring Cleaning special problem greedy sortings 1600	0 / 0	5
	3015	P1346D Constructing the Dungeon special problem graphs greedy 1600	0 / 0	5
	3014	P1346E Magic Tricks special problem dp graphs 1700	0 / 0	5
	3013	P1346F Dune II: Battle For Arrakis special problem data structures greedy math 2000	0 / 0	7
	3012	P1346G Two IP Cameras special problem math number theory 2300	0 / 0	8
	3011	P1346H Game with Segments special problem data structures games 2700	0 / 0	10
	3010	P1346I Pac-Man 2.0 special problem dp 2900	0 / 0	10
	3009	P1348A Phoenix and Balance greedy math *800	0 / 0	3
	3008	P1348B Phoenix and Beauty constructive algorithms data structures greedy sortings *1400	0 / 0	4
	3007	P1348C Phoenix and Distribution constructive algorithms greedy sortings strings *1600	0 / 0	5
	3006	P1348D Phoenix and Science binary search constructive algorithms greedy implementation math *1900	0 / 0	6
	3005	P1348E Phoenix and Berries brute force dp greedy math *2400	0 / 0	9
	3004	P1348F Phoenix and Memory data structures dfs and similar graphs greedy *2600	0 / 0	10
	3003	P1349A Orac and LCM data structures math number theory *1600	0 / 0	5
	3002	P1349B Orac and Medians constructive algorithms greedy math *2000	0 / 0	7
	3001	P1349C Orac and Game of Life dfs and similar graphs implementation shortest paths *2000	0 / 0	7
	3000	P1349D Slime and Biscuits math probabilities *3200	0 / 0	10
	2999	P1349E Slime and Hats constructive algorithms dp greedy *3500	0 / 0	10
	2998	P1349F1 Slime and Sequences (Easy Version) dp fft math *3100	0 / 0	10
	2997	P1349F2 Slime and Sequences (Hard Version) dp fft math *3500	0 / 0	10
	2996	P1350A Orac and Factors math *900	0 / 0	3
	2995	P1350B Orac and Models dp math number theory *1400	0 / 0	4
	2994	P1351A A+B (Trial Problem) implementation *800	0 / 0	3
	2993	P1351B Square? brute force implementation math *900	0 / 0	3
	2992	P1351C Skier data structures implementation *1400	0 / 0	4
	2991	P1352A Sum of Round Numbers implementation math *800	0 / 0	3
	2990	P1352B Same Parity Summands constructive algorithms math *1200	0 / 0	4
	2989	P1352C K-th Not Divisible by n binary search math *1200	0 / 0	4
	2988	P1352D Alice, Bob and Candies implementation *1300	0 / 0	4
	2987	P1352E Special Elements brute force implementation two pointers *1500	0 / 0	5
	2986	P1352F Binary String Reconstruction constructive algorithms dfs and similar math *1500	0 / 0	5
	2985	P1352G Special Permutation constructive algorithms *1600	0 / 0	5

Pick a problem randomly based on the current filter.