Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5353	P1353B Two Arrays And Swaps greedy sortings *800	0 / 0	(None)
	5354	P1353D Constructing the Array constructive algorithms data structures sortings *1600	0 / 0	(None)
	5355	P1353E K-periodic Garland brute force dp greedy *1900	0 / 0	(None)
	5356	P1354A Alarm Clock math *900	0 / 0	(None)
	5357	P1354C1 Simple Polygon Embedding binary search geometry math ternary search *1400	0 / 0	(None)
	5358	P1354D Multiset binary search data structures *1900	0 / 0	(None)
	5359	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	(None)
	5360	P1354G Find a Gift binary search interactive probabilities *2600	0 / 0	(None)
	5361	P1355B Young Explorers dp greedy sortings *1200	0 / 0	(None)
	5362	P1355C Count Triangles binary search implementation math two pointers *1800	0 / 0	(None)
	5363	P1355E Restorer Distance binary search greedy math sortings ternary search *2100	0 / 0	(None)
	5364	P1355F Guess Divisors Count constructive algorithms interactive number theory *2600	0 / 0	(None)
	5365	P1356A2 Distinguish I from Z *special problem	0 / 0	(None)
	5366	P1356A4 Distinguish I ⊗ X from CNOT *special problem	0 / 0	(None)
	5367	P1356B1 Increment *special problem	0 / 0	(None)
	5368	P1356C Prepare state \|01⟩ + \|10⟩ + \|11⟩ *special problem	0 / 0	(None)
	5369	P1356D2 Quantum Classification - 2 *special problem	0 / 0	(None)
	5370	P1357A2 Distinguish I, CNOTs and SWAP	0 / 0	(None)
	5371	P1357A4 Distinguish Rz from R1	0 / 0	(None)
	5372	P1357A6 Distinguish four Pauli gates	0 / 0	(None)

Pick a problem randomly based on the current filter.