koppt-优快云博客

原创关于并查集

刚开始接触并查集，是因为在做最小生成树题目的时候，对Prim算法和Kruskal算法不熟悉（说起来也囧...），那个时候对这两个算法研究的不深，所以感觉用这两个算法来求解最小生成树的话有点繁琐。所以就上网查了一下大牛的写法，于是就找到了“并查集”这种方法。大牛不愧是大牛啊，用并查集求解最小生成树，太好理解了稍微介绍一下Prim算法和Kruskal算法，这两个算法是寻找最小生成树的经典方法，两者

2011-11-10 13:42:00 590

原创 zoj 1465

不容易系列之一Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7137 Accepted Submissi

2011-10-19 00:26:34 453

转载 __int64 与 long long int

__int64 与long long int在做ACM题时，经常都会遇到一些比较大的整数。而常用的内置整数类型常常显得太小了：其中long 和 int 范围是[-2^31,2^31)，即-2147483648~2147483647。而unsigned范围是[0,2

2011-10-19 00:02:42 557

原创 hdu 2046

骨牌铺方格Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11487 Accepted Submissio

2011-10-19 00:01:48 1074

原创 hdu 2050

折线分割平面Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6824 Accepted Submissio

2011-10-18 23:17:53 557

原创递归求解思考题

1.n在一个平面上有一个圆和n条直线，这些直线中每一条在圆内同其他直线相交，假设没有3条直线相交于一点，试问这些直线将圆分成多少区域。F(1)=2;F(n)= F(n-1)+n;化简后：F(n)= n(n+1)/2 +1;

2011-10-18 18:25:50 1361

原创 zoj 2097 Walking on a Chessboard

Walking on a ChessboardTime Limit: 2 Seconds Memory Limit: 65536 KBA mini robot is put on a cell of a chessboard. The size of t

2011-10-18 10:01:49 942

原创 zoj 2734

Exchange CardsTime Limit: 2 Seconds Memory Limit: 65536 KBAs a basketball fan, Mike is also fond of collecting basketball playe

2011-10-14 16:08:26 766

原创 zoj 1204

Additive equationsTime Limit: 10 Seconds Memory Limit: 32768 KB We all understand that an integer set is a collection of dis

2011-10-14 15:57:05 942

PiTime Limit: 1 Second Memory Limit: 32768 KB Professor Robert A. J. Matthews of the Applied Mathematics and Computer Science Department at the University of Aston in Birmingham, England has recently described how the positions of stars

2011-04-03 18:30:00 524

原创 zoj 1334

Basically SpeakingTime Limit: 1 Second Memory Limit: 32768 KB The Really Neato Calculator Company, Inc. has recently hired your team to help design their Super Neato Model I calculator. As a computer scientist you suggested to the compan

2011-04-02 22:08:00 689

原创 zoj 1331

Perfect CubesTime Limit: 10 Seconds Memory Limit: 32768 KB For hundreds of years Fermat's Last Theorem, which stated simply that for n > 2 there exist no integers a, b, c > 1 such that a^n = b^n + c^n, has remained elusively unproven. (A

2011-04-01 21:55:00 527

原创 zoj 1292

Integer InquiryTime Limit: 1 Second Memory Limit: 32768 KBOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.``Th

2011-03-31 00:31:00 512

原创 ZOJ 1216

DeckTime Limit: 1 Second Memory Limit: 32768 KBScenarioA single playing card can be placed on a table, carefully, so that the

2011-03-26 01:02:00 525

原创 zoj 1205

Martian AdditionTime Limit: 1 Second Memory Limit: 32768 KB In the 22nd Century, scientists have discovered intelligent reside

2011-03-26 00:54:00 659

koppt