Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2498	P1167E Range Deleting binary search combinatorics data structures two pointers *2100	0 / 0	(None)
	2497	P1167F Scalar Queries combinatorics data structures math sortings *2300	0 / 0	(None)
	2496	P1167G Low Budget Inception brute force geometry *3100	0 / 0	(None)
	2495	P1168A Increasing by Modulo binary search greedy *1700	0 / 0	(None)
	2494	P1168B Good Triple brute force two pointers *1900	0 / 0	(None)
	2493	P1168C And Reachability bitmasks dp *2200	0 / 0	(None)
	2492	P1168D Anagram Paths dp implementation trees *3000	0 / 0	(None)
	2491	P1168E Xor Permutations constructive algorithms math *3100	0 / 0	(None)
	2490	P1169A Circle Metro implementation math *900	0 / 0	(None)
	2489	P1169B Pairs graphs implementation *1500	0 / 0	(None)
	2488	P1170A Three Integers Again *special problem math	0 / 0	(None)
	2487	P1170B Bad Days *special problem implementation	0 / 0	(None)
	2486	P1170C Minus and Minus Give Plus *special problem implementation strings	0 / 0	(None)
	2485	P1170D Decoding of Integer Sequences *special problem data structures implementation	0 / 0	(None)
	2484	P1170E Sliding Doors *special problem binary search	0 / 0	(None)
	2483	P1170F Wheels *special problem binary search greedy	0 / 0	(None)
	2482	P1170G Graph Decomposition *special problem graphs	0 / 0	(None)
	2481	P1170H Longest Saw *special problem constructive algorithms	0 / 0	(None)
	2480	P1170I Good Subsets *special problem dp	0 / 0	(None)
	2479	P1172A Nauuo and Cards greedy implementation *1800	0 / 0	(None)

Pick a problem randomly based on the current filter.