上一页 1 ··· 20 21 22 23 24 25 26 27 28 ··· 94 下一页

2013年7月22日

HDU 1846 Brave Game(简单巴什博弈)

摘要: Brave GameTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4500Accepted Submission(s): 2951Problem Description十年前读大学的时候,中国每年都要从国外引进一些电影大片,其中有一部电影就叫《勇敢者的游戏》(英文名称:Zathura),一直到现在,我依然对于电影中的部分电脑特技印象深刻。今天,大家选择上机考试,就是一种勇敢(brave)的选择;这个短学期,我们讲的是博弈(game)专题;所以 阅读全文

posted @ 2013-07-22 11:03 kuangbin 阅读(823) 评论(0) 推荐(0) 编辑

HDU 1564 Play a game (找规律博弈)

摘要: Play a gameTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1030Accepted Submission(s): 838Problem DescriptionNew Year is Coming!ailyanlu is very happy today! and he is playing a chessboard game with 8600.The size of the chessboard is n*n. A stone i 阅读全文

posted @ 2013-07-22 08:55 kuangbin 阅读(2639) 评论(0) 推荐(0) 编辑

HDU 1525 Euclid's Game (博弈)

摘要: Euclid's GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1256Accepted Submission(s): 576Problem DescriptionTwo players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtracts any positive multiple of the 阅读全文

posted @ 2013-07-22 08:25 kuangbin 阅读(3133) 评论(0) 推荐(1) 编辑

博弈小结

摘要: 题集来源:风神博客 http://blog.csdn.net/shahdza/article/details/7832997博弈题集:====================================================================================================HDOJ1079&POJ1082&ZOJ1024Calendar Game[找规律博弈]PN分析下,很容易可以发现规律题解hereHDOJ1525&POJ2348Euclid's Game[找规律博弈]比较有意思的题目。需要找规律,判 阅读全文

posted @ 2013-07-22 07:48 kuangbin 阅读(1259) 评论(1) 推荐(0) 编辑

HDU 1079 Calendar Game(简单博弈)

摘要: Calendar GameTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1871Accepted Submission(s): 1065Problem DescriptionAdam and Eve enter this year’s ACM International Collegiate Programming Contest. Last night, they played the Calendar Game, in celebrati 阅读全文

posted @ 2013-07-22 07:46 kuangbin 阅读(2045) 评论(0) 推荐(0) 编辑

2013年7月18日

[转] 数据输入加速

摘要: 来自风神博客:http://blog.csdn.net/shahdza/article/details/6317011①//适用于正整数template inline void scan_d(T &ret) { char c; ret=0; while((c=getchar())'9'); while(c>='0'&&cinline bool scan_d(T &ret) { char c; int sgn; if(c=getchar(),c==EOF) return 0; //EOF while(c!='-' 阅读全文

posted @ 2013-07-18 21:54 kuangbin 阅读(603) 评论(0) 推荐(0) 编辑

2013年7月16日

POJ 1584 A Round Peg in a Ground Hole(判断凸多边形,点到线段距离,点在多边形内)

摘要: A Round Peg in a Ground HoleTime Limit:1000MSMemory Limit:10000KTotal Submissions:4438Accepted:1362DescriptionThe DIY Furniture company specializes in assemble-it-yourself furniture kits. Typically, the pieces of wood are attached to one another using a wooden peg that fits into pre-cut holes in eac 阅读全文

posted @ 2013-07-16 23:12 kuangbin 阅读(1432) 评论(0) 推荐(0) 编辑

POJ 3449 Geometric Shapes(判断几个不同图形的相交,线段相交判断)

摘要: Geometric ShapesTime Limit:2000MSMemory Limit:65536KTotal Submissions:1243Accepted:524DescriptionWhile creating a customer logo, ACM uses graphical utilities to draw a picture that can later be cut into special fluorescent materials. To ensure proper processing, the shapes in the picture cannot inte 阅读全文

posted @ 2013-07-16 21:12 kuangbin 阅读(1661) 评论(1) 推荐(0) 编辑

POJ 1039 Pipe(直线和线段相交判断,求交点)

摘要: PipeTime Limit:1000MSMemory Limit:10000KTotal Submissions:8280Accepted:2483DescriptionThe GX Light Pipeline Company started to prepare bent pipes for the new transgalactic light pipeline. During the design phase of the new pipe shape the company ran into the problem of determining how far the light 阅读全文

posted @ 2013-07-16 08:38 kuangbin 阅读(2998) 评论(1) 推荐(0) 编辑

POJ 2826 An Easy Problem?!

摘要: An Easy Problem?!Time Limit:1000MSMemory Limit:65536KTotal Submissions:7837Accepted:1145DescriptionIt's raining outside. Farmer Johnson's bull Ben wants some rain to water his flowers. Ben nails two wooden boards on the wall of his barn. Shown in the pictures below, the two boards on the wal 阅读全文

posted @ 2013-07-16 01:12 kuangbin 阅读(2788) 评论(0) 推荐(0) 编辑

上一页 1 ··· 20 21 22 23 24 25 26 27 28 ··· 94 下一页

导航

JAVASCRIPT: