A school bought the first computer some time ago(so this computer's id is 1). During the recent years the school bought N-1 new computers. Each new computer was connected to one of settled earlier. Ma...
分类：
其他好文 时间：
2015-02-26 10:03:12
阅读次数：
162
Computer
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3731 Accepted Submission(s): 1886
Problem Description
A school bought the...
分类：
其他好文 时间：
2015-02-25 17:13:17
阅读次数：
123
Problem Description
Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property o...
分类：
其他好文 时间：
2015-02-25 14:16:04
阅读次数：
178
Time Limit:3000MS Memory Limit:0KBDescriptionBackgroundMany areas of Computer Science use simple, abstract domains for both analytical and empirical s...
Time Limit:3000MS Memory Limit:0KBDescriptionQueues and Priority Queues are data structures which are known to most computer scientists. The Team Queu...
ComputerTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3731Accepted Submission(s): 1886Problem De...
分类：
其他好文 时间：
2015-02-24 19:49:53
阅读次数：
161
Y2K Accounting BugTime Limit:1000MSMemory Limit:65536KTotal Submissions:10945Accepted:5499DescriptionAccounting for Computer Machinists (ACM) has suff...
分类：
其他好文 时间：
2015-02-24 15:05:07
阅读次数：
134
At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in's and out's, you...
分类：
其他好文 时间：
2015-02-24 12:38:14
阅读次数：
136
题意：有一个01串，每一步都会将所有的0变为10，将所有的1变为01，串最开始为1.求第n步之后，00的个数分析：刚开始想的时候还是比较乱的，我还纠结了一下000中算是有1个00还是2个00最终想明白后，并不会出现这样的子串。总结了几个要点：第n步之后，串的长度为2n，且0和1的个数相等，分别为2n...
分类：
其他好文 时间：
2015-02-23 21:14:07
阅读次数：
213
题目链接：http://poj.org/problem?id=1325As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very ...
分类：
系统相关 时间：
2015-02-22 13:25:36
阅读次数：
225
