Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2984	P1353A Most Unstable Array constructive algorithms greedy math *800	0 / 0	3
	2983	P1353B Two Arrays And Swaps greedy sortings *800	0 / 0	3
	2982	P1353C Board Moves math *1000	0 / 0	3
	2981	P1353D Constructing the Array constructive algorithms data structures sortings *1600	0 / 0	5
	2980	P1353E K-periodic Garland brute force dp greedy *1900	0 / 0	6
	2979	P1353F Decreasing Heights brute force dp *2200	0 / 0	8
	2978	P1354A Alarm Clock math *900	0 / 0	3
	2977	P1354B Ternary String binary search dp implementation two pointers *1200	0 / 0	4
	2976	P1354C1 Simple Polygon Embedding binary search geometry math ternary search *1400	0 / 0	4
	2975	P1354C2 Not So Simple Polygon Embedding binary search brute force geometry math *2000	0 / 0	7
	2974	P1354D Multiset binary search data structures *1900	0 / 0	6
	2973	P1354E Graph Coloring dfs and similar dp graphs *2100	0 / 0	7
	2972	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	9
	2971	P1354G Find a Gift binary search interactive probabilities *2600	0 / 0	10
	2970	P1355A Sequence with Digits brute force implementation math *1200	0 / 0	4
	2969	P1355B Young Explorers dp greedy sortings *1200	0 / 0	4
	2968	P1355C Count Triangles binary search implementation math two pointers *1800	0 / 0	6
	2967	P1355D Game With Array constructive algorithms math *1400	0 / 0	4
	2966	P1355E Restorer Distance binary search greedy math sortings ternary search *2100	0 / 0	7
	2965	P1355F Guess Divisors Count constructive algorithms interactive number theory *2600	0 / 0	10
	2964	P1356A1 Distinguish I from X *special problem	0 / 0	(None)
	2963	P1356A2 Distinguish I from Z *special problem	0 / 0	(None)
	2962	P1356A3 Distinguish Z from S *special problem	0 / 0	(None)
	2961	P1356A4 Distinguish I ⊗ X from CNOT *special problem	0 / 0	(None)
	2960	P1356A5 Distinguish Z from -Z *special problem	0 / 0	(None)
	2959	P1356B1 Increment *special problem	0 / 0	(None)
	2958	P1356B2 Decrement *special problem	0 / 0	(None)
	2957	P1356C Prepare state \|01⟩ + \|10⟩ + \|11⟩ *special problem	0 / 0	(None)
	2956	P1356D1 Quantum Classification - 1 *special problem	0 / 0	(None)
	2955	P1356D2 Quantum Classification - 2 *special problem	0 / 0	(None)
	2954	P1357A1 Figure out direction of CNOT	0 / 0	(None)
	2953	P1357A2 Distinguish I, CNOTs and SWAP	0 / 0	(None)
	2952	P1357A3 Distinguish H from X	0 / 0	(None)
	2951	P1357A4 Distinguish Rz from R1	0 / 0	(None)
	2950	P1357A5 Distinguish Rz(θ) from Ry(θ)	0 / 0	(None)
	2949	P1357A6 Distinguish four Pauli gates	0 / 0	(None)
	2948	P1357A7 Distinguish Y, XZ, -Y and -XZ	0 / 0	(None)
	2947	P1357B1 "Is the bit string balanced?" oracle	0 / 0	(None)
	2946	P1357B2 "Is the number divisible by 3?" oracle	0 / 0	(None)
	2945	P1357C1 Prepare superposition of basis states with 0s	0 / 0	(None)
	2944	P1357C2 Prepare superposition of basis states with the same parity	0 / 0	(None)
	2943	P1357D1 Quantum Classification - Dataset 3	0 / 0	(None)
	2942	P1357D2 Quantum Classification - Dataset 4	0 / 0	(None)
	2941	P1357D3 Quantum Classification - Dataset 5	0 / 0	(None)
	2940	P1357D4 Quantum Classification - Dataset 6	0 / 0	(None)
	2939	P1357D5 Quantum Classification - Dataset 7	0 / 0	(None)
	2938	P1357E1 Power of quantum Fourier transform	0 / 0	(None)
	2937	P1357E2 Root of quantum Fourier transform	0 / 0	(None)
	2936	P1358A Park Lighting greedy math *800	0 / 0	3
	2935	P1358B Maria Breaks the Self-isolation greedy sortings *1000	0 / 0	3
	2934	P1358C Celex Update math *1600	0 / 0	5
	2933	P1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	6
	2932	P1358E Are You Fired? constructive algorithms data structures greedy implementation *2400	0 / 0	9
	2931	P1358F Tasty Cookie binary search constructive algorithms greedy implementation *2700	0 / 0	10
	2930	P1359A Berland Poker brute force greedy math *1000	0 / 0	3
	2929	P1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	3
	2928	P1359C Mixing Water binary search math *1700	0 / 0	5
	2927	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	7
	2926	P1359E Modular Stability combinatorics math number theory *2000	0 / 0	7
	2925	P1359F RC Kaboom Show binary search brute force data structures geometry math *2900	0 / 0	10
	2924	P1360A Minimal Square greedy math *800	0 / 0	3
	2923	P1360B Honest Coach greedy sortings *800	0 / 0	3
	2922	P1360C Similar Pairs constructive algorithms graph matchings greedy sortings *1100	0 / 0	3
	2921	P1360D Buying Shovels math number theory *1300	0 / 0	4
	2920	P1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	4
	2919	P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	5
	2918	P1360G A/B Matrix constructive algorithms greedy math *1900	0 / 0	6
	2917	P1360H Binary Median binary search bitmasks brute force constructive algorithms *2100	0 / 0	7
	2916	P1361A Johnny and Contribution constructive algorithms graphs greedy sortings *1700	0 / 0	5
	2915	P1361B Johnny and Grandmaster greedy implementation math sortings *1900	0 / 0	6
	2914	P1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	9
	2913	P1361D Johnny and James greedy implementation math trees *2900	0 / 0	10
	2912	P1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	10
	2911	P1361F Johnny and New Toy data structures implementation math *3300	0 / 0	10
	2910	P1362A Johnny and Ancient Computer implementation *1000	0 / 0	3
	2909	P1362B Johnny and His Hobbies bitmasks brute force *1200	0 / 0	4
	2908	P1362C Johnny and Another Rating Drop bitmasks greedy math *1400	0 / 0	4
	2907	P1363A Odd Selection brute force implementation math *1200	0 / 0	4
	2906	P1363B Subsequence Hate implementation strings *1400	0 / 0	4
	2905	P1363C Game On Leaves games trees *1600	0 / 0	5
	2904	P1363D Guess The Maximums binary search implementation interactive math *2100	0 / 0	7
	2903	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	7
	2902	P1363F Rotating Substrings dp strings *2600	0 / 0	10
	2901	P1364A XXXXX brute force data structures number theory two pointers *1200	0 / 0	4
	2900	P1364B Most socially-distanced subsequence greedy two pointers *1300	0 / 0	4
	2899	P1364C Ehab and Prefix MEXs brute force constructive algorithms greedy *1600	0 / 0	5
	2898	P1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	0 / 0	7
	2897	P1364E X-OR bitmasks constructive algorithms divide and conquer interactive probabilities *2700	0 / 0	10
	2896	P1365A Matrix Game games greedy implementation *1100	0 / 0	3
	2895	P1365B Trouble Sort constructive algorithms implementation *1300	0 / 0	4
	2894	P1365C Rotation Matching constructive algorithms data structures greedy implementation *1400	0 / 0	4
	2893	P1365D Solve The Maze constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths *1700	0 / 0	5
	2892	P1365E Maximum Subsequence Value brute force constructive algorithms *1900	0 / 0	6
	2891	P1365F Swaps Again constructive algorithms implementation sortings *2100	0 / 0	7
	2890	P1365G Secure Password bitmasks combinatorics constructive algorithms interactive math *2800	0 / 0	10
	2889	P1366A Shovels and Swords binary search greedy math *1100	0 / 0	3
	2888	P1366B Shuffle math two pointers *1300	0 / 0	4
	2887	P1366C Palindromic Paths greedy math *1500	0 / 0	5
	2886	P1366D Two Divisors constructive algorithms math number theory *2000	0 / 0	7
	2885	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	7

Pick a problem randomly based on the current filter.