Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3298	P1002D1 Oracle for f(x) = b * x mod 2 *1200	0 / 0	(None)
	3297	P1002D2 Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2 *1300	0 / 0	(None)
	3296	P1002D3 Oracle for majority function *1600	0 / 0	(None)
	3295	P1002E1 Bernstein-Vazirani algorithm *1500	0 / 0	(None)
	3294	P1002E2 Another array reconstruction algorithm *1900	0 / 0	(None)
	3293	P1003A Polycarp's Pockets implementation *800	0 / 0	(None)
	3292	P1003B Binary String Constructing constructive algorithms *1300	0 / 0	(None)
	3291	P1003C Intense Heat brute force implementation math *1300	0 / 0	(None)
	3290	P1003D Coins and Queries greedy *1600	0 / 0	(None)
	3289	P1003E Tree Constructing constructive algorithms graphs *2100	0 / 0	(None)
	3288	P1003F Abbreviation dp hashing strings *2200	0 / 0	(None)
	3287	P1004A Sonya and Hotels implementation *900	0 / 0	(None)
	3286	P1004B Sonya and Exhibition constructive algorithms greedy implementation math *1300	0 / 0	(None)
	3285	P1004C Sonya and Robots constructive algorithms implementation *1400	0 / 0	(None)
	3284	P1004D Sonya and Matrix brute force constructive algorithms implementation *2300	0 / 0	(None)
	3283	P1004E Sonya and Ice Cream binary search data structures dp greedy shortest paths trees *2400	0 / 0	(None)
	3282	P1004F Sonya and Bitwise OR bitmasks data structures divide and conquer *2600	0 / 0	(None)
	3281	P1005A Tanya and Stairways implementation *800	0 / 0	(None)
	3280	P1005B Delete from the Left brute force implementation strings *900	0 / 0	(None)
	3279	P1005C Summarize to the Power of Two brute force greedy implementation *1300	0 / 0	(None)

Pick a problem randomly based on the current filter.