题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	8545	P1861C Queries for the Array data structures dfs and similar implementation strings trees *1600	0 / 0	5
	8546	P1861C Queries for the Array data structures dfs and similar implementation strings trees *1600	0 / 0	5
	8544	P1861D Sorting By Multiplication dp greedy *1800	0 / 0	6
	8542	P1861E Non-Intersecting Subpermutations combinatorics dp implementation math *2300	0 / 0	8
	8543	P1861E Non-Intersecting Subpermutations combinatorics dp implementation math *2300	0 / 0	8
	8541	P1861F Four Suits binary search bitmasks flows greedy *3200	0 / 0	10
	8539	P1862A Gift Carpet dp greedy implementation strings *800	0 / 0	3
	8540	P1862A Gift Carpet dp greedy implementation strings *800	0 / 0	3
	8538	P1862B Sequence Game constructive algorithms *800	0 / 0	3
	8536	P1862C Flower City Fence binary search data structures implementation sortings *1100	0 / 0	3
	8537	P1862C Flower City Fence binary search data structures implementation sortings *1100	0 / 0	3
	8535	P1862D Ice Cream Balls binary search combinatorics constructive algorithms math *1300	0 / 0	4
	8533	P1862E Kolya and Movie Theatre constructive algorithms data structures greedy *1600	0 / 0	5
	8534	P1862E Kolya and Movie Theatre constructive algorithms data structures greedy *1600	0 / 0	5
	8532	P1862F Magic Will Save the World binary search bitmasks brute force dp *1800	0 / 0	6
	8530	P1862G The Great Equalizer binary search data structures math sortings *2000	0 / 0	7
	8531	P1862G The Great Equalizer binary search data structures math sortings *2000	0 / 0	7
	8529	P1863A Channel greedy implementation *800	0 / 0	3
	8527	P1863B Split Sort greedy math sortings *1100	0 / 0	3
	8528	P1863B Split Sort greedy math sortings *1100	0 / 0	3
	8526	P1863C MEX Repetition implementation math *1100	0 / 0	3
	8524	P1863D Two-Colored Dominoes constructive algorithms greedy *1400	0 / 0	4
	8525	P1863D Two-Colored Dominoes constructive algorithms greedy *1400	0 / 0	4
	8523	P1863E Speedrun brute force dfs and similar dp graphs greedy math sortings two pointers *2100	0 / 0	7
	8521	P1863F Divide, XOR, and Conquer bitmasks dp math *2600	0 / 0	10
	8522	P1863F Divide, XOR, and Conquer bitmasks dp math *2600	0 / 0	10
	8520	P1863G Swaps combinatorics dp graphs math *2800	0 / 0	10
	8518	P1863H Goldberg Machine 3 dp trees *3500	0 / 0	10
	8519	P1863H Goldberg Machine 3 dp trees *3500	0 / 0	10
	8517	P1863I Redundant Routes constructive algorithms dp trees *3500	0 / 0	10
	8515	P1864A Increasing and Decreasing constructive algorithms greedy implementation math *800	0 / 0	3
	8516	P1864A Increasing and Decreasing constructive algorithms greedy implementation math *800	0 / 0	3
	8514	P1864B Swap and Reverse constructive algorithms greedy sortings strings *1100	0 / 0	3
	8512	P1864C Divisor Chain bitmasks constructive algorithms math number theory *1300	0 / 0	4
	8513	P1864C Divisor Chain bitmasks constructive algorithms math number theory *1300	0 / 0	4
	8511	P1864D Matrix Cascade brute force constructive algorithms data structures dp greedy math *1700	0 / 0	5
	8509	P1864E Guess Game bitmasks data structures games math probabilities sortings strings trees *2100	0 / 0	7
	8510	P1864E Guess Game bitmasks data structures games math probabilities sortings strings trees *2100	0 / 0	7
	8508	P1864F Exotic Queries data structures implementation sortings *2300	0 / 0	8
	8506	P1864G Magic Square combinatorics constructive algorithms implementation *3100	0 / 0	10
	8507	P1864G Magic Square combinatorics constructive algorithms implementation *3100	0 / 0	10
	8505	P1864H Asterism Stream dp math matrices *3200	0 / 0	10
	8503	P1864I Future Dominators graphs greedy *3500	0 / 0	10
	8504	P1864I Future Dominators graphs greedy *3500	0 / 0	10
	8502	P1866A Ambitious Kid math *800	0 / 0	3
	8500	P1866B Battling with Numbers combinatorics math number theory *1400	0 / 0	4
	8501	P1866B Battling with Numbers combinatorics math number theory *1400	0 / 0	4
	8499	P1866C Completely Searching for Inversions dfs and similar dp graphs *1900	0 / 0	6
	8497	P1866D Digital Wallet dp greedy *2300	0 / 0	8
	8498	P1866D Digital Wallet dp greedy *2300	0 / 0	8
	8496	P1866E Elevators of Tamem dp *2700	0 / 0	10
	8495	P1866F Freak Joker Process binary search data structures sortings *3100	0 / 0	10
	8494	P1866G Grouped Carriages binary search data structures dp flows greedy *2100	0 / 0	7
	8493	P1866H Happy Sets combinatorics *2100	0 / 0	7
	8491	P1866I Imagination Castle dp games two pointers *2300	0 / 0	8
	8492	P1866I Imagination Castle dp games two pointers *2300	0 / 0	8
	8490	P1866J Jackets and Packets dp *2800	0 / 0	10
	8488	P1866K Keen Tree Calculation binary search data structures dp geometry graphs implementation trees *2500	0 / 0	9
	8489	P1866K Keen Tree Calculation binary search data structures dp geometry graphs implementation trees *2500	0 / 0	9
	8487	P1866L Lihmuf Balling binary search brute force math *2400	0 / 0	9
	8485	P1866M Mighty Rock Tower brute force combinatorics dp math probabilities *2400	0 / 0	9
	8486	P1866M Mighty Rock Tower brute force combinatorics dp math probabilities *2400	0 / 0	9
	8484	P1867A green_gold_dog, array and permutation constructive algorithms sortings *800	0 / 0	3
	8482	P1867B XOR Palindromes bitmasks constructive algorithms strings *1100	0 / 0	3
	8483	P1867B XOR Palindromes bitmasks constructive algorithms strings *1100	0 / 0	3
	8481	P1867C Salyg1n and the MEX Game constructive algorithms data structures games greedy interactive *1300	0 / 0	4
	8479	P1867D Cyclic Operations brute force constructive algorithms dfs and similar graphs greedy implementation *1800	0 / 0	6
	8480	P1867D Cyclic Operations brute force constructive algorithms dfs and similar graphs greedy implementation *1800	0 / 0	6
	8477	P1867E1 Salyg1n and Array (simple version) constructive algorithms interactive math *2000	0 / 0	7
	8478	P1867E1 Salyg1n and Array (simple version) constructive algorithms interactive math *2000	0 / 0	7
	8475	P1867E2 Salyg1n and Array (hard version) constructive algorithms interactive *2200	0 / 0	8
	8476	P1867E2 Salyg1n and Array (hard version) constructive algorithms interactive *2200	0 / 0	8
	8473	P1867F Most Different Tree brute force constructive algorithms dfs and similar greedy hashing *2700	0 / 0	10
	8474	P1867F Most Different Tree brute force constructive algorithms dfs and similar greedy hashing *2700	0 / 0	10
	8472	P1868A Fill in the Matrix constructive algorithms implementation *1300	0 / 0	4
	8471	P1868B1 Candy Party (Easy Version) bitmasks constructive algorithms graphs greedy implementation math *1700	0 / 0	5
	8469	P1868B2 Candy Party (Hard Version) bitmasks constructive algorithms dp greedy implementation math *2100	0 / 0	7
	8470	P1868B2 Candy Party (Hard Version) bitmasks constructive algorithms dp greedy implementation math *2100	0 / 0	7
	8468	P1868C Travel Plan combinatorics dp implementation math trees *2400	0 / 0	9
	8467	P1868D Flower-like Pseudotree constructive algorithms graphs greedy implementation trees *3000	0 / 0	10
	8465	P1868E Min-Sum-Max constructive algorithms dp greedy *3500	0 / 0	10
	8466	P1868E Min-Sum-Max constructive algorithms dp greedy *3500	0 / 0	10
	8464	P1868F LIS? data structures greedy implementation *3500	0 / 0	10
	8462	P1869A Make It Zero constructive algorithms *900	0 / 0	3
	8463	P1869A Make It Zero constructive algorithms *900	0 / 0	3
	8461	P1869B 2D Traveling geometry math shortest paths sortings *1100	0 / 0	3
	8460	P1870A MEXanized Array constructive algorithms greedy math *800	0 / 0	3
	8458	P1870B Friendly Arrays bitmasks greedy math *1200	0 / 0	4
	8459	P1870B Friendly Arrays bitmasks greedy math *1200	0 / 0	4
	8457	P1870C Colorful Table binary search data structures dp implementation math two pointers *1300	0 / 0	4
	8456	P1870D Prefix Purchase greedy implementation sortings *1800	0 / 0	6
	8454	P1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	0 / 0	8
	8455	P1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	0 / 0	8
	8453	P1870F Lazy Numbers binary search math *2900	0 / 0	10
	8452	P1870G MEXanization data structures *3300	0 / 0	10
	8450	P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	8451	P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	8449	P1872A Two Vessels brute force greedy math *800	0 / 0	3
	8448	P1872B The Corridor or There and Back Again greedy implementation *900	0 / 0	3
	8446	P1872C Non-coprime Split math number theory *1100	0 / 0	3

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