07 2017 档案
摘要：Garland Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 2365 Accepted: 1007 Description The New Year garland consists of N lamps attached t
阅读全文
摘要：Maximum Sequence Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1152 Accepted Submission(s): 537
阅读全文
摘要：Regular polygon Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1529 Accepted Submission(s): 597
阅读全文
摘要：Balala Power! Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3757 Accepted Submission(s): 907
阅读全文
摘要：Function Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 273 Accepted Submission(s): 99 Problem
阅读全文
摘要：Telephone Lines Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7115 Accepted: 2603 Description Farmer John wants to set up a telephone lin
阅读全文
摘要：费马小定理证明 费马小定理定义：假如p是质数，且gcd(a,p)=1，那么a^(p-1)≡1（mod p），就是说，如果p是质数，并且a与p互质，那么a的p-1次方膜上p恒等于1。下面给出证明： 例如：13是一个质数，那么1,2,3,4,5,6,7,8,9,10,11,12乘上一个与13互质的数，比
阅读全文
摘要：Out of Hay Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17502 Accepted: 6888 Description The cows have run out of hay, a horrible event
阅读全文
摘要：Bad Cowtractors Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15445 Accepted: 6339 Description Bessie has been hired to build a cheap int
阅读全文
摘要：Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 59025 Accepted: 24473 Description Farmer John has been elected mayor of his town!
阅读全文
摘要：Wormholes Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 52062 Accepted: 19373 Description While exploring his many farms, Farmer John has
阅读全文
摘要：Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 22580 Accepted: 10333 Description One cow from each of N farms (1 ≤ N ≤ 10
阅读全文
摘要：Six Degrees of Cowvin Bacon Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5766 Accepted: 2712 Description The cows have been making movie
阅读全文
摘要：Find them, Catch them Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 46119 Accepted: 14193 Description The police office in Tadu City deci
阅读全文
摘要：Moo University - Financial Aid Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 9578 Accepted: 2785 Description Bessie noted that although h
阅读全文
摘要：Wireless Network Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 28655 Accepted: 11865 Description An earthquake takes place in Southeast
阅读全文
摘要：Sunscreen Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9014 Accepted: 3164 Description To avoid unsightly burns while tanning, each of t
阅读全文
摘要：Wooden Sticks Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22142 Accepted Submission(s): 8902
阅读全文
摘要：Meteor Shower Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 20463 Accepted: 5313 Description Bessie hears that an extraordinary meteor sh
阅读全文
摘要：Curling 2.0 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 21605 Accepted: 8799 Description On Planet MM-21, after their Olympic games thi
阅读全文
摘要：1.数据进行离散化的时候,开区间离散化端点,闭区间一般用两个点离散一个端点.例如: 开区间 [1.5] 实际的离散化之后应该是 [ (1,2) , (4,5) ].
阅读全文