2011年7月30日

ACM POJ 1328Radar Installation

摘要: Radar InstallationTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 27114Accepted: 5912DescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on 阅读全文

posted @ 2011-07-30 12:01 kuangbin 阅读(2871) 评论(0) 推荐(0) 编辑

ACM POJ 2965 The Pilots Brothers' refrigerator

摘要: http://poj.org/problem?id=2965The Pilots Brothers' refrigeratorTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10158Accepted: 3707Special JudgeDescriptionThe game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a refrigerator.There are 16 ha 阅读全文

posted @ 2011-07-30 10:49 kuangbin 阅读(879) 评论(0) 推荐(0) 编辑

ACM POJ 1753Flip Game

摘要: Flip GameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 14735Accepted: 6321DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it's bl 阅读全文

posted @ 2011-07-30 01:36 kuangbin 阅读(1696) 评论(0) 推荐(0) 编辑

2011年7月29日

POJ题目分类

摘要: 初期:一.基本算法: (1)枚举. (poj1753,poj2965) (2)贪心(poj1328,poj2109,poj2586) (3)递归和分治法. (4)递推. (5)构造法.(poj3295) (6)模拟法.(poj1068,poj2632,poj1573,poj2993,poj2996)二.图算法: (1)图的深度优先遍历和广度优先遍历. (2)最短路径算法(dijkstra,bellman-ford,floyd,heap+dijkstra) (poj1860,poj3259,poj1062,poj2253,poj1125,poj2240) (3)最小生成树算法(prim,krus 阅读全文

posted @ 2011-07-29 10:19 kuangbin 阅读(75012) 评论(17) 推荐(43) 编辑

ACM HDU 1020Encoding

摘要: EncodingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11132Accepted Submission(s): 4673Problem DescriptionGiven a string containing only 'A' - 'Z', we could encode it using the following method: 1. Each sub-string containing k sam 阅读全文

posted @ 2011-07-29 00:53 kuangbin 阅读(1762) 评论(0) 推荐(0) 编辑

2011年7月28日

关于qsort的完整版

摘要: 六种qsort排序方法<本文中排序都是采用的从小到大排序>一、对int类型数组排序int num[100];Sample:int cmp ( const void *a , const void *b ){ return *(int *)a - *(int *)b;}qsort(num,100,sizeof(num[0]),cmp);二、对char类型数组排序(同int类型)char word[100];Sample:int cmp( const void *a , const void *b ){ return *(char *)a - *(char *)b;}qsort(wor 阅读全文

posted @ 2011-07-28 21:10 kuangbin 阅读(376) 评论(0) 推荐(0) 编辑

ACM HDU 1040 As Easy As A+B

摘要: As Easy As A+BTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15920Accepted Submission(s): 6448Problem DescriptionThese days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of cou 阅读全文

posted @ 2011-07-28 20:37 kuangbin 阅读(1479) 评论(0) 推荐(0) 编辑

ACM HDU 1016 Prime Ring Problem

摘要: Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8651Accepted Submission(s): 3877Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of num 阅读全文

posted @ 2011-07-28 20:20 kuangbin 阅读(684) 评论(0) 推荐(0) 编辑

ACM HDU 1017 A Mathematical Curiosity

摘要: A Mathematical CuriosityTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10942Accepted Submission(s): 3371Problem DescriptionGiven two integers n and m, count the number of pairs of integers (a,b) such that 0 < a < b < n and (a^2+b^2 +m)/(a 阅读全文

posted @ 2011-07-28 18:08 kuangbin 阅读(487) 评论(0) 推荐(0) 编辑

ACM HDU 3668Volume

摘要: VolumeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 531Accepted Submission(s): 159Problem DescriptionThis time your job is to calculate the volume of a special object. The object consists of two orthogonal cylinders. The two cylinders intersect e 阅读全文

posted @ 2011-07-28 17:43 kuangbin 阅读(350) 评论(0) 推荐(0) 编辑

导航

JAVASCRIPT: