Poj(北大)
文章平均质量分 86
hdweilao
这个作者很懒,什么都没留下…
展开
-
Poj.1556 The Doors【线段相交+最短路】 2015/08/24
The DoorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7136 Accepted: 2818DescriptionYou are to find the length of the shortest path through a chamb原创 2015-08-24 21:39:40 · 269 阅读 · 0 评论 -
Poj.3086 Triangular Sums【水~】 2015/09/24
Triangular SumsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6677 Accepted: 4747DescriptionThe nth Triangular number, T(n) = 1 + … + n, is the sum o原创 2015-09-24 22:17:55 · 301 阅读 · 0 评论 -
Poj.2398 Toy Storage【数学几何】 2015/08/21
Toy StorageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4620 Accepted: 2734DescriptionMom and dad have a problem: their child, Reza, never puts his t原创 2015-08-21 17:55:53 · 206 阅读 · 0 评论 -
Poj.2318 TOYS【数学几何】 2015/08/21
TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12071 Accepted: 5820DescriptionCalculate the number of toys that land in each bin of a partitioned t原创 2015-08-21 11:33:23 · 222 阅读 · 0 评论 -
Poj.2262 Goldbach's Conjecture【素数】 2015/09/22
Goldbach's ConjectureTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 41186 Accepted: 15776DescriptionIn 1742, Christian Goldbach, a German amateur mathe原创 2015-09-22 15:04:44 · 313 阅读 · 0 评论 -
Poj.1455 Crazy tea party 2015/09/22
Crazy tea partyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7233 Accepted: 4915Descriptionn participants of > sit around the table. Each minute one p原创 2015-09-22 14:52:40 · 316 阅读 · 0 评论 -
Poj.2249 Binomial Showdown【组合数】 2015/09/23
Binomial ShowdownTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18695 Accepted: 5713DescriptionIn how many ways can you choose k elements out of n elem原创 2015-09-23 16:43:12 · 264 阅读 · 0 评论 -
Poj.2590 Steps【“英语题”,水】 2015/09/22
StepsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7825 Accepted: 3600DescriptionOne steps through integer points of the straight line. The length of原创 2015-09-22 22:04:09 · 448 阅读 · 0 评论 -
Poj.1775 Sum of Factorials【略坑】 2015/10/12
Sum of FactorialsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 13191 Accepted: 4371DescriptionJohn von Neumann, b. Dec. 28, 1903, d. Feb. 8, 1957, was a原创 2015-10-12 12:15:02 · 368 阅读 · 0 评论 -
Poj.3100 Root of the Problem【水】 2015/09/22
Root of the ProblemTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11964 Accepted: 6410DescriptionGiven positive integers B and N, find an integer A suc原创 2015-09-22 17:37:14 · 362 阅读 · 0 评论 -
Poj.2546 Circular Area【两圆相交面积】 2015/09/23
Circular AreaTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5475 Accepted: 2170DescriptionYour task is to write a program, which, given two circles, ca原创 2015-09-23 22:29:57 · 365 阅读 · 0 评论 -
Poj.2689 Prime Distance【素数筛选】 2015/11/13
Prime DistanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14884 Accepted: 3949DescriptionThe branch of mathematics called number theory is about pro原创 2015-11-13 21:52:04 · 341 阅读 · 0 评论 -
Poj.2007 Scrambled Polygon【凸包】 2015/09/02
Scrambled PolygonTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7622 Accepted: 3626DescriptionA closed polygon is a figure bounded by a finite number o原创 2015-09-02 23:05:19 · 245 阅读 · 0 评论 -
Poj.1113 Wall【凸包】 2015/08/29
WallTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 32422 Accepted: 10998DescriptionOnce upon a time there was a greedy King who ordered his chief Archi原创 2015-08-29 22:40:19 · 236 阅读 · 0 评论 -
Poj.1107 W's Cipher【水题】 2015/04/22
W's CipherTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5227 Accepted: 2633DescriptionWeird Wally's Wireless Widgets, Inc. manufactures an eclectic as原创 2015-04-22 19:03:26 · 299 阅读 · 0 评论 -
Poj.2506 Tiling【水题】 2015/04/20
TilingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7998 Accepted: 3884DescriptionIn how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles?原创 2015-04-20 20:07:18 · 225 阅读 · 0 评论 -
poj.3641 Pseudoprime numbers【快速幂取模】 20141127
Pseudoprime numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6657 Accepted: 2705DescriptionFermat's theorem states that for any prime number p and原创 2014-11-27 21:07:54 · 287 阅读 · 0 评论 -
Poj.1062 昂贵的聘礼【迪杰斯特拉 最短路】 2015/04/14
昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 39134 Accepted: 11342Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给原创 2015-04-14 15:58:32 · 365 阅读 · 0 评论 -
Poj.3393 Lucky and Good Months by Gregorian Calendar【模拟】 2015/05/15
Lucky and Good Months by Gregorian CalendarTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1553 Accepted: 511DescriptionHave you ever wondered why norma原创 2015-05-15 16:01:46 · 378 阅读 · 0 评论 -
Poj.1995 Raising Modulo Numbers【快速幂取模】 2015/04/22
Raising Modulo NumbersTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5092 Accepted: 2963DescriptionPeople are different. Some secretly read magazines f原创 2015-04-22 14:02:39 · 194 阅读 · 0 评论 -
Poj.1305 Fermat vs. Pythagoras【毕达哥拉斯三角形】 2015/04/21
Fermat vs. PythagorasTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 1388 Accepted: 803DescriptionComputer generated and assisted proofs and verificatio原创 2015-04-21 18:46:22 · 514 阅读 · 0 评论 -
Poj.1696 Space Ant【极角排序】 2015/08/27
Space AntTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3705 Accepted: 2311DescriptionThe most exciting space discovery occurred at the end of the 20th原创 2015-08-27 15:37:01 · 271 阅读 · 0 评论 -
Poj.3233 Matrix Power Series【矩阵快速幂】 2015/07/29
Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 17793 Accepted: 7515DescriptionGiven a n × n matrix A and a positive integer k, fi原创 2015-07-29 17:05:12 · 320 阅读 · 0 评论 -
Poj.2826 An Easy Problem?![【计算几何-线段】 2015/08/28
An Easy Problem?!Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10833 Accepted: 1631DescriptionIt's raining outside. Farmer Johnson's bull Ben wants so原创 2015-08-28 10:27:08 · 326 阅读 · 0 评论 -
Poj.2074 Line of Sight【计算几何-线段】 2015/08/28
Line of SightTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3875 Accepted: 1210DescriptionAn architect is very proud of his new home and wants to be su原创 2015-08-28 19:03:51 · 390 阅读 · 0 评论 -
Poj.1730 Perfect Pth Powers【数学】 2015/11/13
Perfect Pth PowersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17232 Accepted: 3946DescriptionWe say that x is a perfect square if, for some integer原创 2015-11-13 20:11:56 · 387 阅读 · 0 评论