BestCoder
关注
分享
扫一扫
文章平均质量分 81
GKHack
这个作者很懒，什么都没留下…
展开
-
BestCoder Round #63 (div.2) HDOJ5567 sequence1(暴力)
sequence1Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 132 Accepted Submission(s): 103Problem DescriptionGiven an array a w原创 2015-11-22 11:11:49 · 692 阅读 · 0 评论 -
BestCoder Round #63 (div.2) HDOJ5568 sequence2(dp + 大数)
sequence2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 231 Accepted Submission(s): 95Problem DescriptionGiven an integer ar原创 2015-11-22 21:15:29 · 949 阅读 · 0 评论 -
BestCoder Round #63 (div.2) HDOJ5570 balls(数学期望)
ballsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 90 Accepted Submission(s): 59Problem DescriptionThere are n balls with原创 2015-11-23 00:10:00 · 913 阅读 · 0 评论 -
BestCoder Round #63 (div.2) HDOJ5569 matrix(dp)
matrixTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 304 Accepted Submission(s): 187Problem DescriptionGiven a matrix with n原创 2015-11-22 23:19:49 · 1057 阅读 · 0 评论 -
BestCoder Round #62 (div.2) HDOJ5564 Clarke and digits(dp + 快速幂)
Clarke and digitsTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 88 Accepted Submission(s): 44Problem DescriptionClarke is a原创 2015-11-18 10:55:40 · 1346 阅读 · 0 评论 -
BestCoder Round #61 HDOJ5522 5523 5524题解
题目链接: 点击打开链接A: 直接无脑暴力枚举三个数, 或者枚举前两个数, 第三个数二分, 我用了stl的lower_bound()AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;const int MAXN = 105原创 2015-10-31 23:46:21 · 1112 阅读 · 0 评论 -
BestCoder Round #62 (div.2) HDOJ5562 Clarke and food(脑洞)
Clarke and foodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 501 Accepted Submission(s): 292Problem DescriptionClarke is a原创 2015-11-18 10:23:01 · 1010 阅读 · 0 评论 -
BestCoder Round #62 (div.2) HDOJ5563 Clarke and five-pointed star(计算几何)
Clarke and five-pointed starTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 468 Accepted Submission(s): 247Problem Description原创 2015-11-18 10:36:16 · 973 阅读 · 0 评论 -
BestCoder Round #64 (div.2) HDOJ5585 Numbers(模拟)
NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 449 Accepted Submission(s): 280Problem DescriptionThere is a number N.原创 2015-12-03 23:31:30 · 836 阅读 · 0 评论 -
BestCoder Round #64 (div.2) HDOJ5586 Sum(脑洞)
SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 671 Accepted Submission(s): 355Problem DescriptionThere is a number sequen原创 2015-12-03 23:43:25 · 920 阅读 · 0 评论 -
BestCoder Round #64 (div.2) HDOJ5587 Array(dfs)
ArrayTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 490 Accepted Submission(s): 235Problem DescriptionVicky is a magician原创 2015-12-04 00:00:23 · 1000 阅读 · 0 评论 -
BestCoder Round #65 HDOJ5592 ZYB's Premutation(树状数组+二分)
ZYB's PremutationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 638 Accepted Submission(s): 302Problem DescriptionZYB has原创 2015-12-08 16:24:05 · 1272 阅读 · 0 评论 -
BestCoder Round #43B HDOJ5265 pog loves szh II(脑洞)
pog loves szh IITime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2346 Accepted Submission(s): 677Problem DescriptionPog and Sz原创 2016-02-27 22:36:22 · 569 阅读 · 0 评论 -
BestCoder Round #60 HDOJ5504 5505 5506题解
题目链接:点击打开链接A: 读入数据的时候先把非0的乘到一起, 然后对n分类讨论, n为1直接输出a[0], 0的个数为n输出0. 而后对ans分类讨论, 大于0直接输出, 小于0的时候, 若0的个数为n - 1输出0, 其他情况则找到绝对值最小的负数除掉就为答案.AC代码:#include "iostream"#include "cstdio"#include "cs原创 2015-10-30 21:42:06 · 997 阅读 · 0 评论 -
BestCoder Round #58 (div.2) HDOJ5494 5495 5496 5497题解
题目连接: 点击打开链接A: 模拟题, 从小到大排序后求a的前m个和与b的后m个和作比较即可.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;const int MAXN = 505;int n, m, a[MAXN]原创 2015-11-15 13:09:28 · 1080 阅读 · 0 评论 -
BestCoder Round #50 (div.2) & HDOJ5364 Search Result(模拟)
InputThere are multiply cases.For each case,there is a single integer n(1In second line,there are n integer a1,a2...an(0 OutputOutput ID of the man who should be punished.If原创 2015-08-09 10:33:55 · 1029 阅读 · 0 评论 -
BestCoder Round #53 (div.2) HDOJ5423 Rikka with Tree(bfs)
Rikka with TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 312 Accepted Submission(s): 156Problem DescriptionAs we know,原创 2015-08-30 16:51:19 · 1051 阅读 · 0 评论 -
BestCoder Round #53 (div.2) HDOJ5424 Rikka with Graph II(dfs & 哈密顿通路判断)
Rikka with Graph IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 717 Accepted Submission(s): 174Problem DescriptionAs we kn原创 2015-08-30 19:58:05 · 870 阅读 · 0 评论 -
BestCoder Round #53 (div.2) HDOJ5422 Rikka with Graph(floyd)
Rikka with GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 232 Accepted Submission(s): 124Problem DescriptionAs we know,原创 2015-08-30 15:19:13 · 134 阅读 · 0 评论 -
BestCoder Round #59 HDOJ5499 5500 5501题解
题目链接: 点击打开链接A: 模拟题, 读入数据的时候记录有没有女选手以及round1 & round2最大值, 排序后分类讨论, 如果全为男选手直接输出m个, 如果有女选手, 再分类讨论女选手在不在前m个中.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"原创 2015-11-03 20:56:42 · 1098 阅读 · 0 评论 -
BestCoder Round #54 (div.2) HDOJ5430 Reflect(欧拉函数＋脑洞)
ReflectTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 274 Accepted Submission(s): 162Problem DescriptionWe send a light from原创 2015-09-07 06:53:39 · 987 阅读 · 0 评论 -
BestCoder Round #54 (div.2) HDOJ 5429 Geometric Progression(模拟)
Geometric ProgressionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 316 Accepted Submission(s): 86Problem DescriptionDetermi原创 2015-09-06 01:43:44 · 1179 阅读 · 0 评论 -
BestCoder Round #54 (div.2) HDOJ 5427 A problem of sorting(模拟)
A problem of sortingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 240 Accepted Submission(s): 115Problem DescriptionThere a原创 2015-09-05 23:59:38 · 1089 阅读 · 0 评论 -
BestCoder Round #54 (div.2) HDOJ5428 The Factor(脑洞)
The FactorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 495 Accepted Submission(s): 154Problem DescriptionThere is a sequen原创 2015-09-06 01:09:09 · 168 阅读 · 0 评论 -
BestCoder Round #51 (div.2) & HDOJ5391 Zball in Tina Town(数论)
Zball in Tina TownTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 305 Accepted Submission(s): 186Problem DescriptionTina To原创 2015-08-16 09:45:32 · 922 阅读 · 0 评论 -
BestCoder Round #49 ($) HDOJ5339 Untitled(dfs)
InputThe first line contains one integer T≤5, which represents the number of testcases. For each testcase, there are two lines:1. The first line contains two integers n and a (1≤n≤20,1≤a原创 2015-08-09 10:05:56 · 1008 阅读 · 0 评论 -
BestCoder Round #49 ($) HDOJ5340 Three Palindromes(暴力)
Problem DescriptionCan we divided a given string S into three nonempty palindromes? InputFirst line contains a single integer T≤20 which denotes the number of test cases.For原创 2015-08-09 10:12:17 · 1040 阅读 · 0 评论 -
BestCoder Round #50 (div.2) & HDOJ5366 The mook jong(dp)
Problem DescriptionZJiaQ want to become a strong man, so he decided to play the mook jong。ZJiaQ want to put some mook jongs in his backyard. His backyard consist of n bricks that is 1*1,so it is原创 2015-08-09 10:37:48 · 1016 阅读 · 0 评论 -
BestCoder Round #81 (div.2)C HDOJ5672 String(双指针法)
StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 813 Accepted Submission(s): 258Problem DescriptionThere is a string S.S原创 2016-04-24 22:02:40 · 801 阅读 · 0 评论