小寒

Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequence of lines, each containing an integer n. (

取石子游戏Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 35918 Accepted: 12140Description有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二

Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7281 Accepted Submission(s): 4150Problem DescriptionSuppose that we have a sq

Network SaboteurTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9706 Accepted: 4633DescriptionA university network is composed of N computers. System administrators gathered inform

SumsetsTime Limit: 2000MS Memory Limit: 200000KTotal Submissions: 14323 Accepted: 5699DescriptionFarmer John commanded his cows to search for different sets of numbers that sum to a given nu

PacketsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 46895 Accepted: 15868DescriptionA factory produces products packed in square packets of the same height h and of the sizes 1*