	ID	题目显示标签隐藏标签	AC / 尝试	难度
	3911	P776A A Serial Killer brute force implementation strings *900	0 / 0	(无)
	3910	P776B Sherlock and his girlfriend constructive algorithms number theory *1200	0 / 0	(无)
	3909	P776C Molly's Chemicals binary search brute force data structures implementation math *1800	0 / 0	(无)
	3908	P776D The Door Problem 2-sat dfs and similar dsu graphs *2000	0 / 0	(无)
	3907	P776E The Holmes Children math number theory *2100	0 / 0	(无)
	3906	P776F Sherlock's bet to Moriarty constructive algorithms data structures divide and conquer geometry graphs implementation trees *2800	0 / 0	(无)
	3905	P776G Sherlock and the Encrypted Data bitmasks combinatorics dp *2900	0 / 0	(无)
	3904	P777A Shell Game constructive algorithms implementation math *1000	0 / 0	(无)
	3903	P777B Game of Credit Cards data structures dp greedy sortings *1300	0 / 0	(无)
	3902	P777C Alyona and Spreadsheet binary search data structures dp greedy implementation two pointers *1600	0 / 0	(无)
	3901	P777D Cloud of Hashtags binary search greedy implementation strings *1800	0 / 0	(无)
	3900	P777E Hanoi Factory brute force data structures dp greedy sortings *2000	0 / 0	(无)
	3899	P778A String Game binary search greedy strings *1700	0 / 0	(无)
	3898	P778B Bitwise Formula bitmasks brute force dfs and similar expression parsing implementation *1800	0 / 0	(无)
	3897	P778C Peterson Polyglot brute force dfs and similar dsu hashing strings trees *2500	0 / 0	(无)
	3896	P778D Parquet Re-laying constructive algorithms *2700	0 / 0	(无)
	3895	P778E Selling Numbers dp sortings *3000	0 / 0	(无)
	3894	P779A Pupils Redistribution constructive algorithms math *1000	0 / 0	(无)
	3893	P779B Weird Rounding brute force greedy *1100	0 / 0	(无)
	3892	P779C Dishonest Sellers constructive algorithms greedy sortings *1200	0 / 0	(无)
	3891	P780A Andryusha and Socks implementation *800	0 / 0	(无)
	3890	P780B The Meeting Place Cannot Be Changed binary search *1600	0 / 0	(无)
	3889	P780C Andryusha and Colored Balloons dfs and similar graphs greedy trees *1600	0 / 0	(无)
	3888	P780D Innokenty and a Football League 2-sat graphs greedy implementation shortest paths strings *1900	0 / 0	(无)
	3887	P780E Underground Lab constructive algorithms dfs and similar graphs *2100	0 / 0	(无)
	3886	P780F Axel and Marston in Bitland bitmasks dp graphs matrices *2400	0 / 0	(无)
	3885	P780G Andryusha and Nervous Barriers data structures dp *2700	0 / 0	(无)
	3884	P780H Intranet of Buses binary search geometry implementation two pointers *3100	0 / 0	(无)
	3883	P784A Numbers Joke special problem 1700	0 / 0	(无)
	3882	P784B Kids' Riddle special problem 2000	0 / 0	(无)
	3881	P784C INTERCALC special problem implementation 1800	0 / 0	(无)
	3880	P784D Touchy-Feely Palindromes special problem implementation 1900	0 / 0	(无)
	3879	P784E Twisted Circuit special problem brute force implementation 2000	0 / 0	(无)
	3878	P784F Crunching Numbers Just for You special problem implementation 1900	0 / 0	(无)
	3877	P784G BF Calculator special problem 2000	0 / 0	(无)
	3876	P785A Anton and Polyhedrons implementation strings *800	0 / 0	(无)
	3875	P785B Anton and Classes greedy sortings *1100	0 / 0	(无)
	3874	P785C Anton and Fairy Tale binary search math *1600	0 / 0	(无)
	3873	P785D Anton and School - 2 combinatorics dp math number theory *2300	0 / 0	(无)
	3872	P785E Anton and Permutation brute force data structures *2200	0 / 0	(无)
	3871	P786A Berzerk dfs and similar dp games *2000	0 / 0	(无)
	3870	P786B Legacy data structures graphs shortest paths *2300	0 / 0	(无)
	3869	P786C Till I Collapse data structures divide and conquer *2400	0 / 0	(无)
	3868	P786D Rap God data structures dfs and similar hashing strings trees *3400	0 / 0	(无)
	3867	P786E ALT data structures flows graphs trees *3200	0 / 0	(无)
	3866	P787A The Monster brute force math number theory *1200	0 / 0	(无)
	3865	P787B Not Afraid greedy implementation math *1300	0 / 0	(无)
	3864	P788A Functions again dp two pointers *1600	0 / 0	(无)
	3863	P788B Weird journey combinatorics constructive algorithms dfs and similar dsu graphs *2100	0 / 0	(无)
	3862	P788C The Great Mixing dfs and similar graphs shortest paths *2300	0 / 0	(无)
	3861	P788D Finding lines constructive algorithms divide and conquer interactive *3000	0 / 0	(无)
	3860	P788E New task data structures *2900	0 / 0	(无)
	3859	P789A Anastasia and pebbles implementation math *1100	0 / 0	(无)
	3858	P789B Masha and geometric depression brute force implementation math *1700	0 / 0	(无)
	3857	P791A Bear and Big Brother implementation *800	0 / 0	(无)
	3856	P792A New Bus Route implementation sortings *1100	0 / 0	(无)
	3855	P792B Counting-out Rhyme implementation *1300	0 / 0	(无)
	3854	P792C Divide by Three dp greedy math number theory *2000	0 / 0	(无)
	3853	P792D Paths in a Complete Binary Tree bitmasks trees *1900	0 / 0	(无)
	3852	P792E Colored Balls greedy math number theory *2500	0 / 0	(无)
	3851	P792F Mages and Monsters data structures geometry *3100	0 / 0	(无)
	3850	P793A Oleg and shares implementation math *900	0 / 0	(无)
	3849	P793B Igor and his way to work dfs and similar graphs implementation shortest paths *1600	0 / 0	(无)
	3848	P793C Mice problem geometry implementation math sortings *2300	0 / 0	(无)
	3847	P793D Presents in Bankopolis dp graphs shortest paths *2100	0 / 0	(无)
	3846	P793E Problem of offices constructive algorithms dfs and similar dp trees *2900	0 / 0	(无)
	3845	P793F Julia the snail data structures divide and conquer dp *3000	0 / 0	(无)
	3844	P793G Oleg and chess data structures divide and conquer flows graph matchings *3400	0 / 0	(无)
	3843	P794A Bank Robbery brute force implementation *800	0 / 0	(无)
	3842	P794B Cutting Carrot geometry math *1200	0 / 0	(无)
	3841	P794C Naming Company games greedy sortings *1800	0 / 0	(无)
	3840	P794D Labelling Cities dfs and similar graphs hashing *2400	0 / 0	(无)
	3839	P794E Choosing Carrot games math *2800	0 / 0	(无)
	3838	P794F Leha and security system data structures *2800	0 / 0	(无)
	3837	P794G Replace All combinatorics dp math *3400	0 / 0	(无)
	3836	P796A Buying A House brute force implementation *800	0 / 0	(无)
	3835	P796B Find The Bone implementation *1300	0 / 0	(无)
	3834	P796C Bank Hacking constructive algorithms data structures dp trees *1900	0 / 0	(无)
	3833	P796D Police Stations constructive algorithms dfs and similar dp graphs shortest paths trees *2100	0 / 0	(无)
	3832	P796E Exam Cheating binary search dp *2400	0 / 0	(无)
	3831	P796F Sequence Recovery bitmasks data structures greedy *2800	0 / 0	(无)
	3830	P797A k-Factorization implementation math number theory *1100	0 / 0	(无)
	3829	P797B Odd sum dp greedy implementation *1400	0 / 0	(无)
	3828	P797C Minimal string data structures greedy strings *1700	0 / 0	(无)
	3827	P797D Broken BST data structures dfs and similar *2100	0 / 0	(无)
	3826	P797E Array Queries brute force data structures dp *2000	0 / 0	(无)
	3825	P797F Mice and Holes data structures dp greedy sortings *2600	0 / 0	(无)
	3824	P798A Mike and palindrome brute force constructive algorithms strings *1000	0 / 0	(无)
	3823	P798B Mike and strings brute force dp strings *1300	0 / 0	(无)
	3822	P798C Mike and gcd problem dp greedy number theory *1700	0 / 0	(无)
	3821	P798D Mike and distribution constructive algorithms sortings *2400	0 / 0	(无)
	3820	P798E Mike and code of a permutation constructive algorithms data structures graphs sortings *3000	0 / 0	(无)
	3819	P799A Carrot Cakes brute force implementation *1100	0 / 0	(无)
	3818	P799B T-shirt buying data structures implementation *1400	0 / 0	(无)
	3817	P799C Fountains binary search data structures implementation *1800	0 / 0	(无)
	3816	P799D Field expansion brute force dp meet-in-the-middle *2100	0 / 0	(无)
	3815	P799E Aquarium decoration data structures greedy two pointers *2500	0 / 0	(无)
	3814	P799F Beautiful fountains rows data structures *3500	0 / 0	(无)
	3813	P799G Cut the pie binary search data structures geometry *3500	0 / 0	(无)
	3812	P801A Vicious Keyboard brute force *1100	0 / 0	(无)

HGNU

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

状态

支持

开发与维护

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

特别鸣谢

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

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