2013 年 2月随笔档案 - cssystem

POJ1067 取石子游戏跪跪跪，很好的博弈论

摘要：取石子游戏Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 29951Accepted: 9814Description有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目，如果轮到你先取，假设双方都采取最好的策略，问最后你是胜者还是败者。Input输入包含若干行，表示若干种石子的初始情况，其中每一行包含两个非负整数a和b，表示两堆石子的数目，a和b都阅读全文

posted @ 2013-02-22 19:22 cssystem 阅读(1732) 评论(0) 推荐(0)

5.2.6 Box Relations

摘要：Box RelationsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 270 Accepted Submission(s): 108 Problem Description There are n boxes C1, C2, ..., Cn in 3D space. The edges of the boxes are parallel to the x, y or z-axis. We provide ... 阅读全文

posted @ 2013-02-21 11:36 cssystem 阅读(104) 评论(0) 推荐(0)

5.2.8 Safe Or Unsafe

摘要：Safe Or UnsafeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 90 Accepted Submission(s): 50 Problem Description Javac++ 一天在看计算机的书籍的时候，看到了一个有趣的东西！每一串字符都可以被编码成一些数字来储存信息，但是不同的编码方式得到的储存空间是不一样的！并且当储存空间大于一定的值的时候是不安全的！所以Javac++ 就想是否有一种方式... 阅读全文

posted @ 2013-02-20 22:20 cssystem 阅读(202) 评论(0) 推荐(0)

5.2.7 Entropy

摘要：EntropyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 189 Accepted Submission(s): 110 Problem Description An entropy encoder is a data encoding method that achieves lossless data compression by encoding a message with “wasted” or... 阅读全文

posted @ 2013-02-20 22:18 cssystem 阅读(177) 评论(0) 推荐(0)

5.2.5 Stock Chase

摘要：Stock ChaseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 207 Accepted Submission(s): 64 Problem Description I have to admit, the solution I proposed last year for solving the bank cash crisis didn’t solve the whole economic cris... 阅读全文

posted @ 2013-02-20 22:12 cssystem 阅读(199) 评论(0) 推荐(0)

5.2.4 确定比赛名次

摘要：确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 206 Accepted Submission(s): 118 Problem Description 有N个比赛队（1<=N<=500），编号依次为1，2，3，。。。。，N进行比赛，比赛结束后，裁判委员会要将所有参赛队伍从前往后依次排名，但现在裁判委员会不能直接获得每个队的比赛成绩，只知道每场比赛的结果，即P1赢P2，用P1，P2表示，排名时P1在... 阅读全文

posted @ 2013-02-20 11:35 cssystem 阅读(177) 评论(0) 推荐(0)

5.2.2 统计难题

摘要：统计难题Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 207 Accepted Submission(s): 126 Problem Description Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). Input 输入数据的第一部分是一张单词表,每... 阅读全文

posted @ 2013-02-17 11:41 cssystem 阅读(167) 评论(0) 推荐(0)

Concrete Math 混凝土数学（具体数学）随笔

摘要：第一章：Recurrent Problems三个例题：THE TOWER OF HANOI、1.2 LINES IN THE PLANE、THE JOSEPHUS PROBLEM很有意思，讲的很好！三个都是递推问题，我学了以后，感触很深，现在就讲讲本蒟蒻的心得吧~汉诺塔问题：一个递推，原本的很简单，关键是例题的变种！LINES IN THE PLANE给你n条直线，问这n条直线最多可将平面划分为多少个区域？书上告诉我们，我们应该先从小数据开始。L0=1这是显然的，L1=2,L2=4，这些都能很快地得出。于是我们开始想，我们应该怎么样切第n刀，能将形成的用n-1刀切成的平面增加的更多？经过简单的阅读全文

posted @ 2013-02-15 22:54 cssystem 阅读(520) 评论(0) 推荐(0)

5.2.1 Hat’s Words

摘要：Hat’s WordsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 135 Accepted Submission(s): 61 Problem Description A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.You are ... 阅读全文

posted @ 2013-02-15 11:42 cssystem 阅读(230) 评论(0) 推荐(0)

5.1.3 Segment set

摘要：Segment setTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 120 Accepted Submission(s): 54 Problem Description A segment and all segments which are connected with it compose a segment set. The size of a segment set is the number of... 阅读全文

posted @ 2013-02-15 10:59 cssystem 阅读(265) 评论(0) 推荐(0)

5.1.8 How Many Answers Are Wrong

摘要：How Many Answers Are WrongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 283 Accepted Submission(s): 134 Problem Description TT and FF are ... friends. Uh... very very good friends -________-bFF is a bad boy, he is always wooing ... 阅读全文

posted @ 2013-02-15 10:03 cssystem 阅读(183) 评论(0) 推荐(0)

5.1.7 Zjnu Stadium

摘要：Zjnu StadiumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 152 Accepted Submission(s): 65 Problem Description In 12th Zhejiang College Students Games 2007, there was a new stadium built in Zhejiang Normal University. It was a mod... 阅读全文

posted @ 2013-02-15 09:59 cssystem 阅读(151) 评论(0) 推荐(0)

5.1.6 Virtual Friends

摘要：Virtual FriendsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 194 Accepted Submission(s): 62 Problem Description These days, you can do all sorts of things online. For example, you can use various websites to make virtual friends... 阅读全文

posted @ 2013-02-14 18:35 cssystem 阅读(221) 评论(0) 推荐(0)

5.1.5 Junk-Mail Filter

摘要：Junk-Mail FilterTime Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 181 Accepted Submission(s): 62 Problem Description Recognizing junk mails is a tough task. The method used here consists of two steps:1) Extract the common character... 阅读全文

posted @ 2013-02-14 17:35 cssystem 阅读(185) 评论(0) 推荐(0)

5.1.4 Dragon Balls

摘要：Dragon BallsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 324 Accepted Submission(s): 154 Problem Description Five hundred years later, the number of dragon balls will increase unexpectedly, so it\\\\\\\'s too difficult for Monk... 阅读全文

posted @ 2013-02-14 12:24 cssystem 阅读(253) 评论(0) 推荐(0)

USACO Section 3.3 Riding The Fences (fence)

摘要：Riding the Fences Farmer John owns a large number of fences that must be repairedannually. He traverses the fences by riding a horse along each andevery one of them (and nowhere else) and fixing the broken parts. Farmer John is as lazy as the next farmer and hates to ride the samefence twice. You... 阅读全文

posted @ 2013-02-13 20:12 cssystem 阅读(207) 评论(0) 推荐(0)

USACO Section 3.2 Sweet Butter (butter)

摘要：Sweet ButterGreg Galperin -- 2001Farmer John has discovered the secret to making the sweetest butter in all of Wisconsin: sugar. By placing a sugar cube out in the pastures, he knows the N (1 <= N <= 500) cows will lick it and thus will produce super-sweet butter which can be marketed at bette 阅读全文

posted @ 2013-02-13 16:17 cssystem 阅读(451) 评论(0) 推荐(0)

USACO Section 3.2 Magic Squares (msquare)

摘要：Magic SquaresIOI'96Following the success of the magic cube, Mr. Rubik invented its planarversion, called magic squares. This is a sheet composed of 8 equal-sizedsquares:12348765 In this task we consider the version where each square has a differentcolor. Colors are denoted by the first 8 positiv 阅读全文

posted @ 2013-02-13 12:50 cssystem 阅读(327) 评论(0) 推荐(0)

USACO Section 3.2 Feed Ratios (ratios)

摘要：Feed Ratios1998 ACM Finals, Dan Adkins Farmer John feeds his cows only the finest mixture of cow food,which has three components: Barley, Oats, and Wheat. While he knowsthe precise mixture of these easily mixable grains, he can not buy thatmixture! He buys three other mixtures of the three grain... 阅读全文

posted @ 2013-02-13 10:34 cssystem 阅读(264) 评论(0) 推荐(0)

USACO Section 3.2 Spinning Wheels (spin)

摘要：Spinning Wheels1998 ACM NE Regionals Each of five opaque spinning wheels has one or more wedges cutout of its edges. These wedges must be aligned quickly and correctly.Each wheel also has an alignment mark (at 0 degrees) so that thewheels can all be started in a known position. Wheels rotate inth... 阅读全文

posted @ 2013-02-13 00:13 cssystem 阅读(418) 评论(0) 推荐(0)

USACO Section 3.2 Stringsobits (kimbits)

摘要：StringsobitsKim Schrijvers Consider an ordered set S of strings of N (1 <= N <= 31)bits. Bits, of course, are either 0 or 1. This set of strings is interesting because it is ordered andcontains all possible strings of length N that have L (1 <= L<= N) or fewer bits that are `1'. Your 阅读全文

posted @ 2013-02-12 22:06 cssystem 阅读(327) 评论(0) 推荐(0)

USACO Section 3.1 Shaping Regions (rect1)

摘要：Shaping RegionsN opaque rectangles (1 <= N <= 1000) of various colors are placed on a white sheet of paper whose size is A wide by B long. The rectangles are put with their sides parallel to the sheet's borders. All rectangles fall within the borders of the sheet so that different figures 阅读全文

posted @ 2013-02-11 19:05 cssystem 阅读(234) 评论(0) 推荐(0)

USACO Section 3.1 Contact (contact)

摘要：ContactIOI'98The cows have developed a new interest in scanning the universeoutside their farm with radiotelescopes. Recently, they noticed a verycurious microwave pulsing emission sent right from the centre of thegalaxy. They wish to know if the emission is transmitted by someextraterrestrial f 阅读全文

posted @ 2013-02-10 17:56 cssystem 阅读(341) 评论(0) 推荐(0)

USACO Section 3.1 Stamps (stamps)

摘要：Stamps Given a set of N stamp values (e.g., {1 cent, 3 cents}) and an upperlimit K to the number of stamps that can fit on an envelope, calculate thelargest unbroken list of postages from 1 cent to M cents that can becreated. For example, consider stamps whose values are limited to 1 cent and 3cent. 阅读全文

posted @ 2013-02-10 12:18 cssystem 阅读(260) 评论(0) 推荐(0)

5.1.2 Is It A Tree?

摘要：Is It A Tree?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 480 Accepted Submission(s): 174 Problem Description A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes con... 阅读全文

posted @ 2013-02-08 12:11 cssystem 阅读(193) 评论(0) 推荐(0)

5.1.1 A Bug's Life

摘要：A Bug's LifeTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 425 Accepted Submission(s): 159 Problem Description Background Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they featur... 阅读全文

posted @ 2013-02-08 12:07 cssystem 阅读(210) 评论(0) 推荐(0)

USACO Section 3.1 Humble Numbers (humble)

摘要：Humble Numbers For a given set of K prime numbers S = {p1, p2,..., pK}, consider the set of all numbers whose prime factors area subset of S. This set contains, for example, p1,p1p2, p1p1, andp1p2p3 (among others). This is the setof `humble numbers' for the input set S. Note: The number 1 is exp 阅读全文

posted @ 2013-02-06 19:42 cssystem 阅读(316) 评论(0) 推荐(0)

USACO Section 3.1 Score Inflation (inflate)

摘要：Score InflationThe more points students score in our contests, the happier we hereat the USACO are. We try to design our contests so that people can scoreas many points as possible, and would like your assistance. We have several categories from which problems can be chosen, wherea "category&qu 阅读全文

posted @ 2013-02-06 10:56 cssystem 阅读(234) 评论(0) 推荐(0)

USACO Section 3.1 Agri-Net (agrinet)

摘要：Agri-NetRuss Cox Farmer John has been elected mayor of his town! One of his campaignpromises was to bring internet connectivity to all farms in the area.He needs your help, of course. Farmer John ordered a high speed connection for his farm and isgoing to share his connectivity with the other farm.. 阅读全文

posted @ 2013-02-06 09:09 cssystem 阅读(342) 评论(0) 推荐(0)

随笔分类

随笔档案

阅读排行榜

评论排行榜

推荐排行榜

最新评论