摘要：
Problem Description There are n lights in a circle numbered from 1 to n. The left of light 1 is light n, and the left of light k (1= 0), if the left of light i is on !!! Given the initiation state, please find all lights’ state after M second. (2 5 #include 6 #include 7 #include ... 阅读全文
摘要：
Problem of PrecisionTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24 Accepted Submission(s): 20 Problem Description Input The first line of input gives the number of cases, T. T test cases follow, each on a sepa... 阅读全文
摘要：
奥运Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 82 Accepted Submission(s): 40 Problem Description 北京迎来了第一个奥运会，我们的欢呼声响彻中国大地，所以今年的奥运金牌 day day up!比尔盖兹坐上鸟巢里，手里摇着小纸扇，看的不亦乐乎，被俺们健儿的顽强拼搏的精神深深的感动了。反正我的钱也多的没地方放了，他对自己说，我自己也来举办一个奥运会，看谁的更火。... 阅读全文
摘要：
PendantTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 58 Accepted Submission(s): 41 Problem Description On Saint Valentine's Day, Alex imagined to present a special pendant to his girl friend made by K kind of pearls. The pendant... 阅读全文
摘要：
A Simple Math ProblemTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 44 Accepted Submission(s): 42 Problem Description Lele now is thinking about a simple function f(x).If x = 10 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 * f(x-3) + ……... 阅读全文
摘要：
最惊心动魄的矩阵一章～～～Tr ATime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 51 Accepted Submission(s): 45 Problem Description A为一个方阵，则Tr A表示A的迹（就是主对角线上各项的和），现要求Tr(A^k)%9973。 Input 数据的第一行是一个T，表示有T组数据。每组数据的第一行有n(2 2 #include ... 阅读全文
摘要：
Snail’s troubleTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 48 Accepted Submission(s): 32 Problem Description Once upon a time, there was a poor snail. Every day, it tried very hard to crawl forward, while there was a keeper ... 阅读全文
摘要：
QueuingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 36 Accepted Submission(s): 29 Problem Description Queues and Priority Queues are data structures which are known to most computer scientists. The Queue occurs often in our da... 阅读全文
摘要：
胜利大逃亡(续)Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 60 Accepted Submission(s): 40 Problem Description Ignatius再次被魔王抓走了(搞不懂他咋这么讨魔王喜欢)……这次魔王汲取了上次的教训，把Ignatius关在一个n*m的地牢里，并在地牢的某些地方安装了带锁的门，钥匙藏在地牢另外的某些地方。刚开始Ignatius被关在(sx,sy)的位置，离开... 阅读全文
摘要：
EquationsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 50 Accepted Submission(s): 36 Problem Description Consider equations having the following form: a*x1^2+b*x2^2+c*x3^2+d*x4^2=0a, b, c, d are integers from the interval [-50,5... 阅读全文
摘要：
The Stable Marriage ProblemTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 32 Accepted Submission(s): 23 Problem Description The stable marriage problem consists of matching members of two different sets according to the member’s ... 阅读全文
摘要：
稳定婚配～～～～～～我是看白书看懂的，当然网上的资料也很好～http://blog.sina.com.cn/s/blog_5f48a0a10101150v.htmlhttp://hi.baidu.com/acmdearway/item/745d54c8160d3dd3964452e9http://en.wikipedia.org/wiki/Stable_marriage_problem简单来说，就是每个男生向自己喜欢的女生表白，然后每个女生从中选择自己认为最好的男生，然后接受这个男生，拒绝其他男生，那么被拒绝的那些男生再重复以上过程，可以证明一定存在合法解，我不得不说读入输出太蛋疼了，主程序还 阅读全文