[Best Coder] 题解
关注
分享
扫一扫
同学少年
没有什么不可能！
展开
-
[BestCoder] Round #36
题目地址 http://bestcoder.hdu.edu.cn/contests/contest_show.php?cid=5741001首先判断长度能不能被3整除，然后字符串分成三段看每段的字母是否相同，再判断一下三段的字符是否各不相同。#define rd(x) scanf("%d",&x)#define rd2(x,y) scanf("%d%d",&x,&y)#def原创 2015-04-05 19:43:53 · 1144 阅读 · 0 评论 -
[BestCoder] Round #11
1001http://acm.hdu.edu.cn/showproblem.php?pid=5054输出Yes只有一种情况.#include #include #include #include #include #include #include #include #include #include #include #include #include #d原创 2015-02-08 17:52:11 · 1352 阅读 · 0 评论 -
[BestCoder] Round #10
1001http://acm.hdu.edu.cn/showproblem.php?pid=5018#include #include #include #include #include #include #include #include #include #include #include #include #include #define rd(x)原创 2015-02-05 11:25:33 · 1068 阅读 · 0 评论 -
[BestCoder] Round #9
1001http://acm.hdu.edu.cn/showproblem.php?pid=4993暴力一下。#include #include #include #include #include #include #include #include #include #include #include #include #include #define原创 2015-02-03 23:58:24 · 985 阅读 · 0 评论 -
[BestCoder] Round #8
1001http://acm.hdu.edu.cn/showproblem.php?pid=4989#include #include #include #include #include #include #include #include #include #include #include #include #include #define rd(x)原创 2015-02-01 15:47:37 · 1035 阅读 · 0 评论 -
[BestCoder] Round #7
1001http://acm.hdu.edu.cn/showproblem.php?pid=4985输出循环节#include #include #include #include #include #include #include #include #include #include #include #include #include #define原创 2015-02-01 15:43:05 · 915 阅读 · 0 评论 -
[BestCoder] Round #6
1001http://acm.hdu.edu.cn/showproblem.php?pid=4981#include #include #include #include #include #include #include #include #include #include #include #include #include #define rd(x)原创 2015-02-01 15:28:15 · 1010 阅读 · 0 评论 -
[BestCoder] Round #3
1001http://acm.hdu.edu.cn/showproblem.php?pid=4907#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace原创 2015-02-01 15:16:58 · 1181 阅读 · 0 评论 -
[BestCoder] Round #2
1001题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4883题意为：有n组客人来吃饭，给出每组客人的人数及用餐开始时间，结束时间，格式为hh:mm；要求一组客人来的时候就必须给其安排位子，问最少需要多少把椅子才能做到（一位客人需要一把椅子）.方法：time[i]，表示第i分钟有多少用餐的人，也就是需要多少把椅子，将开始时间，结束原创 2015-02-01 15:08:21 · 1161 阅读 · 0 评论 -
[ACM] HDU 4885 TIANKENG’s travel (特殊建图，最短路）
TIANKENG’s travel Problem Description TIANKENG has get a driving license and one day he is so lucky to find a car. Every day he drives the car around the city. After a month TIANKE原创 2015-01-13 17:51:01 · 1605 阅读 · 0 评论 -
[ACM] HDU 4884 TIANKENG’s rice shop (模拟）
TIANKENG’s rice shopProblem Description TIANKENG managers a pan fried rice shop. There are n kinds of fried rice numbered 1-n. TIANKENG will spend t time for once frying. Because the pan i原创 2015-01-13 17:29:28 · 1920 阅读 · 0 评论 -
[ACM] HDU 4883 TIANKENG’s restaurant
TIANKENG’s restaurantTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 931 Accepted Submission(s): 412Problem Description TIAN原创 2015-01-13 17:13:59 · 1017 阅读 · 0 评论 -
[ACM] hdu 5147 Sequence II （树状数组，前缀和，后缀和）
Sequence IIProblem DescriptionLong long ago, there is a sequence A with length n. All numbers in this sequence is no smaller than 1 and no bigger than n, and all numbers are different in原创 2014-12-21 14:59:16 · 2493 阅读 · 0 评论 -
[ACM] HDU 5086 Revenge of Segment Tree（所有连续区间的和）
Revenge of Segment TreeProblem DescriptionIn computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments c原创 2014-11-02 10:20:51 · 2369 阅读 · 0 评论 -
[ACM] HDU 5083 Instruction （模拟）
InstructionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 347 Accepted Submission(s): 101Problem Description Nowadays, Jim G原创 2014-10-26 09:35:56 · 1724 阅读 · 0 评论 -
[BestCoder Round #7] hdu 4985 Little Pony and Permutation (找循环节）
Little Pony and PermutationProblem DescriptionAs a unicorn, the ability of using magic is the distinguishing feature among other kind of pony. Being familiar with composition and dec原创 2014-09-01 09:21:01 · 1786 阅读 · 0 评论 -
[BestCoder Round #6] hdu 4982 Goffi and Squary Partition（构造）
Goffi and Squary PartitionProblem DescriptionRecently, Goffi is interested in squary partition of integers.A set X of k distinct positive integers is called squary partition of n if and原创 2014-08-25 11:14:39 · 1395 阅读 · 0 评论 -
[BestCoder Round #6] hdu 4981 Goffi and Median （水题）
Goffi and MedianProblem DescriptionA median in a sequence with the length of n is an element which occupies position number ⌊n+12⌋ after we sort the elements in the non-decreasing order原创 2014-08-25 11:02:32 · 1502 阅读 · 0 评论 -
[BestCoder Round #4] hdu 4932 Miaomiao's Geometry （贪心）
Miaomiao's GeometryTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 363 Accepted Submission(s): 92Problem DescriptionThere原创 2014-08-11 09:55:29 · 1834 阅读 · 0 评论 -
[BestCoder Round #4] hdu 4931 Happy Three Friends
Happy Three FriendsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 70 Accepted Submission(s): 62Problem Description Dong-hao原创 2014-08-11 08:33:47 · 2732 阅读 · 0 评论 -
[BestCoder Round #3] hdu 4908 BestCoder Sequence (计数）
BestCoder SequenceProblem DescriptionMr Potato is a coder.Mr Potato is the BestCoder.One night, an amazing sequence appeared in his dream. Length of this sequence is odd, the median原创 2014-08-04 16:55:18 · 1568 阅读 · 0 评论 -
[BestCoder Round #3] hdu 4907 Task schedule (模拟简单题）
解题思路：一开始原创 2014-08-04 15:04:06 · 1300 阅读 · 0 评论