![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM_数学
文章平均质量分 80
lethic
这个作者很懒,什么都没留下…
展开
-
质因数:arcane number1
Arcane Numbers 1 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1687 Accepted Submission(s): 528 Problem Description Vance and Shac原创 2012-08-05 14:04:11 · 502 阅读 · 0 评论 -
Lucas 定理
【定理】设为质数,,且 , , 其中都是整数,。 证明:。 【推论】当且仅当存在,使得时,。 为奇数的充要条件是,在二进制表达下的每一个数位上的数都不小于的相应数位上的数。转载 2012-08-07 19:19:01 · 381 阅读 · 0 评论 -
大数分解质因数:Mark the Rope
Mark the Rope Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 245 Accepted Submission(s): 73 Problem Description Eric has a long r原创 2012-08-08 13:15:20 · 4775 阅读 · 0 评论 -
找规律:String Change
String change Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 370 Accepted Submission(s): 166 Problem Description In this problem yo原创 2012-08-10 09:30:50 · 975 阅读 · 0 评论 -
【转】三分法——求解凸性函数的极值问题——czyuan原创
二分法作为分治中最常见的方法,适用于单调函数,逼近求解某点的值。但当函数是凸性函数时,二分法就无法适用,这时三分法就可以“大显身手”~~ 如图,类似二分的定义Left和Right,mid = (Left + Right) / 2,midmid = (mid + Right) / 2; 如果mid靠近极值点,则Right = midmid;否则(即midmid靠近极值点)转载 2012-08-10 10:48:58 · 500 阅读 · 0 评论 -
三分法:Party all the time
Party All the Time Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 829 Accepted Submission(s): 308 Problem Description In the Dark f原创 2012-08-10 10:50:42 · 554 阅读 · 0 评论 -
水题:meeting point-1
Meeting point-1 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 987 Accepted Submission(s): 306 Problem Description It has been ten原创 2012-07-27 15:44:10 · 990 阅读 · 0 评论 -
筛法素数表
//先把0到maxm的prime置为1,然后从2开始,for循环j+i的prime置为0即可 #include #include #include using namespace std; int const maxm=1000001; int prime[maxm]; void sievePrime() { for(int i=0;i<maxm;i++) prime[i]=1; pri转载 2012-07-30 09:51:34 · 441 阅读 · 0 评论