摘要:Hints of sd0061 Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2262 Accepted Submission(s): 67
阅读全文
摘要:Regular polygon Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1497 Accepted Submission(s): 582
阅读全文
摘要:题目链接:http://poj.org/problem?id=3264 题目大意: 一个农夫有N头牛,每头牛的高度不同,我们需要找出最高的牛和最低的牛的高度差。 解题思路:经典 RMQ
阅读全文
摘要:GCD Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4141 Accepted Submission(s): 1457 Problem De
阅读全文
摘要:Function Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1025 Accepted Submission(s): 457 Probl
阅读全文
摘要:Balala Power! Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3555 Accepted Submission(s): 844
阅读全文
摘要:n封信放入n个信封,要求全部放错,共有多少种放法,记n个元素的错排总数为f(n) 注意: f[0]=1; f[1]=0; f[2]=1; f(n)=(n-1)*(f(n-1)+f(n-2))
阅读全文
摘要:对于C(n, m) mod p。这里的n,m,p(p为素数)都很大的情况。 就不能再用C(n, m) = C(n - 1,m) + C(n - 1, m - 1)的公式递推了。 一般lucas定理的p不能大,在1e6以内,一下代码应该可以吧 上面是在线的算法,如果数字小还可以用以下写法
阅读全文
摘要:Problem 2275 Game Accept: 62 Submit: 165Time Limit: 1000 mSec Memory Limit : 262144 KB Accept: 62 Submit: 165Time Limit: 1000 mSec Memory Limit : 2621
阅读全文
摘要:Dragon Balls Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description Five hundred years later, the number of dragon balls will in
阅读全文
摘要:Virtual Friends Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description These days, you can do all sorts of things online. For ex
阅读全文
摘要:Building Block Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5811 Accepted Submission(s): 1790
阅读全文
摘要:小希的迷宫 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51962 Accepted Submission(s): 16210 Problem
阅读全文
摘要:Farm Irrigation Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description Benny has a spacious farm land to irrigate. The farm land
阅读全文
摘要:Ball Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1079 Accepted Submission(s): 648 Problem Des
阅读全文
摘要:physics Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 817 Accepted Submission(s): 454 Problem D
阅读全文
摘要:Rikka with Parenthesis II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s
阅读全文
摘要:Romantic Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6643 Accepted Submission(s): 2772 Proble
阅读全文
摘要:题目大意: 输入m个数集,每个含n个数,求从每个集合取一个数后,按非降序输出前n小的和 注意:这题的m,n是反着的
阅读全文
摘要:Railroad Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description A train yard is a complex series of railroad tracks for storing,
阅读全文
摘要:Balls and Boxes Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 798 Accepted Submission(s): 527 P
阅读全文
摘要:Elegant Construction Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1022 Accepted Submission(s):
阅读全文
摘要:Joint Stacks Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1819 Accepted Submission(s): 819 Pro
阅读全文
摘要:To My Girlfriend Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1326 Accepted Submission(s): 515
阅读全文
摘要:A Boring Question Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 865 Accepted Submission(s): 534
阅读全文
摘要:Windows 10 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2191 Accepted Submission(s): 665 Probl
阅读全文
摘要:M斐波那契数列 Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description M斐波那契数列F[n]是一种整数数列,它的定义如下:F[0] = aF[1] = bF[n] = F[n-1] * F[n-2]
阅读全文
摘要:Matrix Multiplication Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 18928 Accepted: 4074 Description You are given three n × n matrices A
阅读全文
摘要:Sum Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description Sample Input 2 Sample Output 2 Hint 1. For N = 2, S(1) = S(2) = 1.2.
阅读全文
摘要:Invoker Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description On of Vance's favourite hero is Invoker, Kael. As many people kno
阅读全文
摘要:Polya定理:设G={π1,π2,π3........πn}是X={a1,a2,a3.......an}上一个置换群,用m中颜色对X中的元素进行涂色,那么不同的涂色方案数为:1/|G|*(mC(π1)+mC(π2)+mC(π3)+...+mC(πk)). 其中C(πk)为置换πk的循环节的个数。
阅读全文
摘要:Necklace of Beads Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 630 Accepted Submission(s): 232
阅读全文