ACM
文章平均质量分 79
qq_15571091
这个作者很懒,什么都没留下…
展开
-
BestCoder Round #57 (div.2) HDU 5479 Scaena Felix
Scaena Felix Accepts: 179 Submissions: 682 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述给定一个由'('和')'组成的字符串,一次修改可以翻转字符串中的一个字符,将'('变成'原创 2015-09-26 21:52:29 · 303 阅读 · 0 评论 -
HDU 5444 Elven Postman
Elven PostmanTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 825 Accepted Submission(s): 445Problem DescriptionElves are ve原创 2015-09-17 20:14:25 · 275 阅读 · 0 评论 -
HDU 1157 POJ 2388 Who's in the Middle 求中位数
Who’s in the MiddleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11821 Accepted Submission(s): 5595Problem Description FJ is surveying原创 2015-09-15 23:14:23 · 583 阅读 · 0 评论 -
Codeforces Round #320 (Div. 2)B. Finding Team Member
B. Finding Team Member time limit per test 2 seconds memory limit per test256 megabytes inputstandard input outputstandard output There is a programing contest named SnakeUp, 2n people want to com原创 2015-09-17 02:23:53 · 450 阅读 · 0 评论 -
趣写算法系列之--匈牙利算法
本文转自:http://blog.csdn.net/dark_scope/article/details/8880547【书本上的算法往往讲得非常复杂,我和我的朋友计划用一些简单通俗的例子来描述算法的流程】匈牙利算法是由匈牙利数学家Edmonds于1965年提出,因而得名。匈牙利算法是基于Hall定理中充分性证明的思想,它是部图匹配最常见的算法,该算法的核心就是寻找增广路径,它是一转载 2015-09-17 20:37:19 · 280 阅读 · 0 评论 -
Codeforces Round #320 (Div. 2)C. A Problem about Polyline
C. A Problem about Polylinetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere is a polyline going throug原创 2015-09-17 02:02:45 · 297 阅读 · 0 评论 -
斐波那契数列的性质
fibonacci数列的性质:1.gcd(fib(n),fib(m))=fib(gcd(n,m))证明:可以通过反证法先证fibonacci数列的任意相邻两项一定互素,然后可证n>m时gcd(fib(n),fib(m))=gcd(fib(n-m),fib(m)),递归可求gcd(fib(n),fib(m))=gcd(fib(k),fib(l)),最后k=l,不然继续递归。K转载 2015-09-17 20:29:12 · 1819 阅读 · 0 评论 -
Codeforces Round #320 (Div. 2)D. "Or" Game
D. “Or” Game time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard outputYou are given n num原创 2015-09-17 18:44:51 · 498 阅读 · 0 评论 -
Codeforces Round #320 (Div. 2) A. Raising Bacteria
A. Raising Bacteriatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are a lover of bacteria. You want to原创 2015-09-17 01:51:23 · 448 阅读 · 0 评论 -
HDU 5437 Alisha’s Party
Alisha’s PartyTime Limit: 3000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1843 Accepted Submission(s): 493Problem DescriptionPrincess A原创 2015-09-15 14:59:56 · 314 阅读 · 0 评论 -
HDU 5443 The Water Problem
The Water ProblemTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 504 Accepted Submission(s): 402Problem DescriptionIn原创 2015-09-15 14:55:22 · 277 阅读 · 0 评论 -
BestCoder Round #54 (div.2) HDU 5428 The Factor(1002)
1002 ( HDU 5428 ) The Factor Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述有一个数列,FancyCoder沉迷于研究这个数列的乘积相关问题,但是它们的乘积往往非常大。幸运的是,FancyCoder只需要找到这个原创 2015-09-13 15:41:11 · 375 阅读 · 0 评论 -
BestCoder Round #54 (div.2)HDU 5429 Geometric Progression(1003)
1003 ( HDU 5429 ) Geometric Progression Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述判断一个数列是否为等比数列。在数学中,等比数列,是一个数列,这个数列中的第一项之后的每一项是前一项乘上原创 2015-09-13 15:45:26 · 362 阅读 · 0 评论 -
BestCoder Round #54 (div.2) HDU 5427 A problem of sorting(1001)
A problem of sorting Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述给出一张许多人的年龄和生日表。你需要从年轻到年老输出人们的名字。(没有人年龄相同)输入描述第一行包含一个正整数T(T \leq 5)T(T≤5原创 2015-09-06 09:19:40 · 295 阅读 · 0 评论 -
BestCoder Round #49 ($) HDU 5340 Three Palindromes(1002)
HDU 5340 Three Palindromes Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述判断是否能将字符串S分成三段非空回文串。输入描述第一行一个整数T,表示数据组数。T \leq 20T≤20对于每一个组,仅包含一原创 2015-09-13 15:34:50 · 319 阅读 · 0 评论 -
BestCoder Round #49 ($) HDU 5339 Untitled(1001)
HDU 5340 Three Palindromes Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述判断是否能将字符串S分成三段非空回文串。输入描述第一行一个整数T,表示数据组数。T \leq 20T≤20对于每一个组,仅包含一原创 2015-09-10 18:39:03 · 304 阅读 · 0 评论 -
HDU3068最长回文
最长回文Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11935 Accepted Submission(s): 4385Problem Description给出一个只由小写英文字符a,b,c...原创 2015-09-10 21:06:39 · 268 阅读 · 0 评论 -
BestCoder Round #57 (div.2)HDU 5480 Conturbatio
Conturbatio Accepts: 206 Submissions: 703 Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述在一个n \times mn×m的国际象棋棋盘上有很多车(Rook),其中车可以攻击他所属原创 2015-09-26 22:37:23 · 357 阅读 · 0 评论 -
BestCoder Round #56 (div.2) HDU5463 Clarke and minecraft
Clarke and minecraft Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述克拉克是一名人格分裂患者。某一天,克拉克分裂成了一个游戏玩家,玩起了minecraft。渐渐地,克拉克建起了一座城堡。 有一天,克拉克为了原创 2015-09-19 23:15:03 · 436 阅读 · 0 评论