	ID	题目显示标签隐藏标签	AC / 尝试	难度
	7414	P1687E Become Big For Me combinatorics constructive algorithms greedy math number theory *3500	0 / 0	(无)
	7413	P1687F Koishi's Unconscious Permutation fft math *3500	0 / 0	(无)
	7412	P1688A Cirno's Perfect Bitmasks Classroom bitmasks brute force *800	0 / 0	(无)
	7411	P1688B Patchouli's Magical Talisman bitmasks constructive algorithms greedy sortings *800	0 / 0	(无)
	7410	P1688C Manipulating History constructive algorithms greedy strings *1700	0 / 0	(无)
	7409	P1689A Lex String brute force greedy implementation sortings two pointers *800	0 / 0	(无)
	7408	P1689B Mystic Permutation data structures greedy *900	0 / 0	(无)
	7407	P1689C Infected Tree dfs and similar dp trees *1600	0 / 0	(无)
	7406	P1689D Lena and Matrix data structures dp geometry shortest paths *1900	0 / 0	(无)
	7405	P1689E ANDfinity bitmasks brute force constructive algorithms dfs and similar dsu graphs *2500	0 / 0	(无)
	7404	P1690A Print a Pedestal (Codeforces logo?) constructive algorithms greedy *800	0 / 0	(无)
	7403	P1690B Array Decrements greedy implementation *800	0 / 0	(无)
	7402	P1690C Restoring the Duration of Tasks data structures greedy implementation *800	0 / 0	(无)
	7401	P1690D Black and White Stripe implementation two pointers *1000	0 / 0	(无)
	7400	P1690E Price Maximization binary search greedy math two pointers *1500	0 / 0	(无)
	7399	P1690F Shifting String graphs math number theory strings *1700	0 / 0	(无)
	7398	P1690G Count the Trains binary search data structures greedy sortings *2000	0 / 0	(无)
	7397	P1691A Beat The Odds brute force greedy math *800	0 / 0	(无)
	7396	P1691B Shoe Shuffling constructive algorithms greedy implementation two pointers *1000	0 / 0	(无)
	7395	P1691C Sum of Substrings brute force constructive algorithms greedy math strings *1400	0 / 0	(无)
	7394	P1691D Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers *1800	0 / 0	(无)
	7393	P1691E Number of Groups data structures dfs and similar dsu graphs greedy sortings *2300	0 / 0	(无)
	7392	P1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	(无)
	7391	P1692A Marathon implementation *800	0 / 0	(无)
	7390	P1692B All Distinct greedy sortings *800	0 / 0	(无)
	7389	P1692C Where's the Bishop? implementation *800	0 / 0	(无)
	7388	P1692D The Clock brute force implementation *1100	0 / 0	(无)
	7387	P1692E Binary Deque binary search implementation two pointers *1200	0 / 0	(无)
	7386	P1692F 3SUM brute force math *1300	0 / 0	(无)
	7385	P1692G 2^Sort data structures dp sortings two pointers *1400	0 / 0	(无)
	7384	P1692H Gambling data structures dp greedy math *1700	0 / 0	(无)
	7383	P1693A Directional Increase greedy *1300	0 / 0	(无)
	7382	P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	(无)
	7381	P1693C Keshi in Search of AmShZ brute force graphs greedy shortest paths *2300	0 / 0	(无)
	7380	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	(无)
	7379	P1693E Outermost Maximums data structures greedy *3400	0 / 0	(无)
	7378	P1693F I Might Be Wrong greedy *3400	0 / 0	(无)
	7377	P1694A Creep greedy implementation *800	0 / 0	(无)
	7376	P1694B Paranoid String constructive algorithms greedy *1200	0 / 0	(无)
	7475	P1695A Subrectangle Guess games	0 / 0	(无)
	7474	P1695B Circle Game games	0 / 0	(无)
	7473	P1695C Zero Path brute force dp greedy shortest paths	0 / 0	(无)
	7472	P1695D1 Tree Queries (Easy Version) constructive algorithms dfs and similar dp greedy trees	0 / 0	(无)
	7471	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees	0 / 0	(无)
	7470	P1695E Ambiguous Dominoes constructive algorithms dfs and similar graphs	0 / 0	(无)
	7375	P1697A Parkway Walk greedy implementation *800	0 / 0	(无)
	7374	P1697B Promo greedy sortings *900	0 / 0	(无)
	7373	P1697C awoo's Favorite Problem binary search constructive algorithms data structures greedy implementation strings two pointers *1400	0 / 0	(无)
	7372	P1697D Guess The String binary search constructive algorithms interactive *1900	0 / 0	(无)
	7371	P1697E Coloring brute force combinatorics constructive algorithms dp geometry graphs greedy implementation math *2400	0 / 0	(无)
	7370	P1697F Too Many Constraints 2-sat constructive algorithms graphs implementation *2800	0 / 0	(无)
	7575	P1873G ABBC or BACB constructive algorithms greedy *1500	0 / 0	5
	7574	P1873H Mad City dfs and similar dsu games graphs shortest paths trees *1700	0 / 0	5
	7573	P1874A Jellyfish and Game brute force games greedy implementation *1200	0 / 0	4
	7572	P1874B Jellyfish and Math bitmasks brute force dfs and similar dp graphs shortest paths *2400	0 / 0	9
	7571	P1874C Jellyfish and EVA dp graphs greedy math probabilities *2300	0 / 0	8
	7570	P1874D Jellyfish and Miku divide and conquer dp math probabilities *2800	0 / 0	10
	7569	P1874E Jellyfish and Hack dp math *3000	0 / 0	10
	7568	P1874F Jellyfish and OEIS dp *3500	0 / 0	10
	7567	P1874G Jellyfish and Inscryption dp *3500	0 / 0	10
	7566	P1875A Jellyfish and Undertale brute force greedy *900	0 / 0	3
	7565	P1875C Jellyfish and Green Apple bitmasks greedy math number theory *1400	0 / 0	4
	7564	P1875D Jellyfish and Mex dp *1600	0 / 0	5
	7563	P1876A Helmets in Night Light greedy sortings *1000	0 / 0	3
	7562	P1876B Effects of Anti Pimples combinatorics number theory sortings *1500	0 / 0	5
	7561	P1876C Autosynthesis constructive algorithms dfs and similar graphs greedy sortings *2100	0 / 0	7
	7560	P1876D Lexichromatography combinatorics dfs and similar dsu graphs two pointers *2500	0 / 0	9
	7559	P1876E Ball-Stackable constructive algorithms data structures dp trees *3300	0 / 0	10
	7558	P1876F Indefinite Clownfish binary search graphs *3500	0 / 0	10
	7557	P1876G Clubstep binary search brute force data structures greedy trees *3500	0 / 0	10
	7556	P1877A Goals of Victory math *800	0 / 0	3
	7555	P1877C Joyboard math number theory *1200	0 / 0	4
	7554	P1878A How Much Does Daytona Cost? greedy *800	0 / 0	3
	7553	P1878B Aleksa and Stack constructive algorithms math *800	0 / 0	3
	7552	P1878C Vasilije in Cacak math *900	0 / 0	3
	7551	P1878D Reverse Madness data structures greedy *1600	0 / 0	5
	7550	P1878E Iva & Pav binary search bitmasks data structures greedy *1400	0 / 0	4
	7549	P1878F Vasilije Loves Number Theory brute force math number theory *1900	0 / 0	6
	7548	P1878G wxhtzdy ORO Tree binary search bitmasks brute force data structures dfs and similar implementation trees *2300	0 / 0	8
	7547	P1879A Rigged! greedy *800	0 / 0	3
	7546	P1879B Chips on the Board constructive algorithms greedy *900	0 / 0	3
	7545	P1879C Make it Alternating combinatorics dp greedy *1300	0 / 0	4
	7544	P1879D Sum of XOR Functions bitmasks combinatorics divide and conquer dp math *1700	0 / 0	5
	7543	P1879E Interactive Game with Coloring brute force constructive algorithms dfs and similar graphs implementation interactive trees *2400	0 / 0	9
	7542	P1879F Last Man Standing brute force data structures number theory *2800	0 / 0	10
	7541	P1881A Don't Try to Count brute force strings *800	0 / 0	3
	7540	P1881B Three Threadlets math *900	0 / 0	3
	7539	P1881C Perfect Square brute force implementation *1200	0 / 0	4
	7538	P1881D Divide and Equalize math number theory *1300	0 / 0	4
	7537	P1881E Block Sequence dp *1500	0 / 0	5
	7536	P1881F Minimum Maximum Distance dfs and similar dp graphs shortest paths trees *1700	0 / 0	5
	7535	P1881G Anya and the Mysterious String binary search data structures *2000	0 / 0	7
	7534	P1882A Increasing Sequence greedy *800	0 / 0	3
	7533	P1882B Sets and Union bitmasks brute force constructive algorithms greedy *1300	0 / 0	4
	7532	P1882C Card Game brute force greedy *1500	0 / 0	5
	7531	P1882D Tree XOR bitmasks dfs and similar dp greedy trees *1900	0 / 0	6
	7530	P1882E1 Two Permutations (Easy Version) brute force constructive algorithms greedy number theory *2400	0 / 0	9
	7529	P1882E2 Two Permutations (Hard Version) constructive algorithms *3100	0 / 0	10
	7528	P1883A Morning math *800	0 / 0	3
	7527	P1883B Chemistry strings *900	0 / 0	3

HGNU

根据当前过滤条件随机选择一道题

状态

支持

开发与维护

杨旭龙、王树淳、王国斌、宋文宇、朱天伦

特别鸣谢

肖飞、关玉蓉、魏银珍、周芬

Worker 0, 157ms
Powered by Hydro v4.13.4
Modified by HGNU ACM TEAM (Repo Link)