暴 力
CrossDolphin
青春看起来如此完美,没空闲去浪费时间。
展开
-
Codeforces Round #346 (Div. 2) A B C D E
链接:戳这里A. Round Housetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya lives in a round building, whose entrances are number原创 2016-03-31 19:05:56 · 928 阅读 · 0 评论 -
hdu 5876 暴力
链接:戳这里Sparse GraphTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Problem DescriptionIn graph theory, the complement of a graph G is a graph原创 2016-09-13 20:27:39 · 424 阅读 · 0 评论 -
hdu 5813 暴力
链接:戳这里Elegant ConstructionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Special JudgeProblem DescriptionBeing an ACMer requires knowledge i原创 2016-08-10 17:21:28 · 300 阅读 · 0 评论 -
2016 Multi-University Training Contest 2 1001 hdu 5734 暴力
链接:戳这里AcperienceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionDeep neural networks (DNN) have shown significant improvements i原创 2016-07-21 17:24:41 · 347 阅读 · 0 评论 -
Codeforces Round #305 (Div. 2) C 循环节
链接:戳这里C. Mike and Frogtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike has a frog and a flower. His frog is named Xaniar an原创 2016-07-20 17:21:58 · 269 阅读 · 0 评论 -
Codeforces Round #363 (Div. 2) B 暴力
链接:戳这里B. One Bombtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a description of a depot. It is a rectangular ch原创 2016-07-20 12:38:09 · 258 阅读 · 0 评论 -
Codeforces Round #309 (Div. 2) B 暴力
链接:戳这里B. Ohana Cleans Uptime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOhana Matsumae is trying to clean a room, which is div原创 2016-07-18 11:59:31 · 251 阅读 · 0 评论 -
BestCoder 2nd Anniversary A hdu 5718 模拟
链接:戳这里Oracle Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)问题描述曾经有一位国王,统治着一片未名之地。他膝下有三个女儿。三个女儿中最年轻漂亮的当属Psyche。她的父亲不确定她未来的命运,于是他来到Delphi神庙求神谕。原创 2016-07-17 23:09:38 · 335 阅读 · 0 评论 -
Codeforces Round #279 (Div. 2) D 暴力
链接:戳这里D. Chocolatetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarpus likes giving presents to Paraskevi. He has bought原创 2016-07-27 20:00:13 · 288 阅读 · 0 评论 -
Codeforces Round #315 (Div. 2) C 暴力找数据范围
链接:戳这里C. Primes or Palindromes?time limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRikhail Mubinchik believes that the current def原创 2016-07-16 15:37:45 · 297 阅读 · 0 评论 -
Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2) B 暴力
链接:戳这里B. Bear and Three Musketeerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDo you know a story about the three musketee原创 2016-07-13 14:30:59 · 302 阅读 · 0 评论 -
Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition) A B C D 模拟
链接:戳这里A. Little Artem and Presentstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Artem got n stones on his birthday and原创 2016-04-25 23:02:34 · 755823 阅读 · 0 评论 -
IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) A B C
链接:戳这里A. Bear and Three Ballstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak is a little polar bear. He has n balls, the i-t原创 2016-03-21 22:11:39 · 1275 阅读 · 0 评论 -
BestCoder Round #76 (div.2) A B C
链接:戳这里DZY Loves Balls Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)问题描述DZY喜欢玩球。他有n个球,装进一个大盒子里。每个球上面都写着一个整数。有一天他打算从盒子中挑两个球出来。他先均匀随机地从盒子中挑原创 2016-03-20 22:34:01 · 427 阅读 · 0 评论 -
Codeforces Round #343 (Div. 2) A B C D
链接:戳这里A. Far Relative’s Birthday Caketime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDoor's family is going celebrate Famil Doors's原创 2016-03-20 22:05:25 · 681 阅读 · 0 评论 -
2016-2017 CT S03E05: Codeforces Trainings Season 3 Episode 5 J
链接:戳这里题意:二维平面上给出n(奇数)个点,要求找出能包围n/2+1个点的面积最小的矩形,该矩形平行于坐标轴思路:枚举矩形的width的边界,然后把框起来的点按y排序,枚举当前y,然后找到Y[I+m-1]的位置,统计最小面积代码:#include #include #include #include using namespace std原创 2016-10-16 13:18:00 · 798 阅读 · 0 评论