Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2478	P1172B Nauuo and Circle combinatorics dfs and similar dp trees *1900	0 / 0	(None)
	2477	P1172C1 Nauuo and Pictures (easy version) dp probabilities *2300	0 / 0	(None)
	2476	P1172C2 Nauuo and Pictures (hard version) dp probabilities *2600	0 / 0	(None)
	2475	P1172D Nauuo and Portals constructive algorithms *2900	0 / 0	(None)
	2474	P1172E Nauuo and ODT data structures *3300	0 / 0	(None)
	2473	P1172F Nauuo and Bug data structures *3300	0 / 0	(None)
	2472	P1173A Nauuo and Votes greedy *800	0 / 0	(None)
	2471	P1173B Nauuo and Chess constructive algorithms greedy *1100	0 / 0	(None)
	2470	P1174A Ehab Fails to Be Thanos constructive algorithms greedy sortings *1000	0 / 0	(None)
	2469	P1174B Ehab Is an Odd Person sortings *1200	0 / 0	(None)
	2468	P1174C Ehab and a Special Coloring Problem constructive algorithms number theory *1300	0 / 0	(None)
	2467	P1174D Ehab and the Expected XOR Problem bitmasks constructive algorithms *1900	0 / 0	(None)
	2466	P1174E Ehab and the Expected GCD Problem combinatorics dp math number theory *2500	0 / 0	(None)
	2465	P1174F Ehab and the Big Finale constructive algorithms divide and conquer graphs implementation interactive trees *2400	0 / 0	(None)
	2464	P1175A From Hero to Zero implementation math *900	0 / 0	(None)
	2463	P1175B Catch Overflow! data structures expression parsing implementation *1600	0 / 0	(None)
	2462	P1175C Electrification binary search brute force greedy *1600	0 / 0	(None)
	2461	P1175D Array Splitting greedy sortings *1900	0 / 0	(None)
	2460	P1175E Minimal Segment Cover data structures dfs and similar divide and conquer dp greedy implementation trees *2200	0 / 0	(None)
	2459	P1175F The Number of Subpermutations brute force data structures divide and conquer hashing math *2500	0 / 0	(None)

Pick a problem randomly based on the current filter.