ACM_计算
LzyRapX
Just For Fun .
展开
-
HDU 5747 BestCoder Round #84 Aaronson (模拟)
AaronsonTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 346 Accepted Submission(s): 210Problem DescriptionRecently, Peter saw the原创 2016-07-24 12:38:06 · 729 阅读 · 0 评论 -
HDU 1165 Eddy's research II (数学推导)
Eddy's research IITime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4366 Accepted Submission(s): 1607Problem DescriptionAs is known,原创 2016-10-06 23:28:08 · 597 阅读 · 0 评论 -
hihocoder #1234 : Fractal 北京赛区(2015)网络赛 (找规律)
#1234 : Fractal时间限制:1000ms单点时限:1000ms内存限制:256MB描述This is the logo of PKUACM 2016. More specifically, the logo is generated as follows:1. Put four points A0(0,0), B0原创 2016-09-24 00:48:44 · 792 阅读 · 0 评论 -
HDU 5832 A water problem (大数取模)
A water problemTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 496 Accepted Submission(s): 26Problem DescriptionTwo planets named H原创 2016-08-15 11:43:34 · 636 阅读 · 0 评论 -
Educational Codeforces Round 15 D. Road to Post Office (数学)
D. Road to Post Officetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasiliy has a car and he wants to get原创 2016-08-10 23:15:14 · 700 阅读 · 0 评论 -
多项式求解(霍纳规则(Horner Rule))
1、霍纳规则(Horner Rule)(算法导论第二章23页左右)霍纳规则是采用最少的乘法运算策略,求多项式在x处的值,该规则为。利用该规则,可以求任意多项式的在x处的值。2、实现代码:int horner(int *a, int n,int x) //霍纳规则{ int ax = a[n] * x + a[n - 1]; //求出在内层括号内的值原创 2016-08-08 23:33:39 · 2647 阅读 · 1 评论 -
HDU 5793 A Boring Question (找规律+快速幂)
A Boring Question题目链接:点我打开链接Source2016 Multi-University Training Contest 6 题意:用m个不大于n的数构成一个序列,对每个序列求C(kj+1,kj)的连乘积。求出所有可能的序列,累加这些连乘积。题解:打表找规律啊。f(n,m)f(1,2)=3; f(1,6)=7; f(2,2原创 2016-08-05 11:17:41 · 629 阅读 · 0 评论 -
HDU 5779 BestCoder Round #85 Tower Defence ( dp升级版 )
Tower DefenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 85 Accepted Submission(s): 50Problem DescriptionLittle White recen原创 2016-07-31 21:46:04 · 790 阅读 · 0 评论 -
HDU 5780 BestCoder Round #85 gcd (数论---欧拉函数)
gcdTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 125 Accepted Submission(s): 41Problem DescriptionLittle White learned the grea原创 2016-07-31 15:51:55 · 697 阅读 · 0 评论 -
HDU 5776 BestCoder Round #85 sum (数学)
sumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 557 Accepted Submission(s): 269Problem DescriptionGiven a sequence, you're ask原创 2016-07-31 11:45:17 · 569 阅读 · 0 评论 -
HDU 5750 BestCoder Round #84 Dertouzos (素数筛选)
DertouzosTime Limit: 7000/3500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1518 Accepted Submission(s): 484Problem DescriptionA positive proper d原创 2016-07-25 16:14:03 · 777 阅读 · 0 评论 -
HDU 5749 BestCoder Round #84 Colmerauer(暴力贡献)
ColmerauerTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 220 Accepted Submission(s): 94Problem DescriptionPeter has an n×m原创 2016-07-25 11:29:44 · 831 阅读 · 0 评论 -
ACdream 1006 Mengzhu (数学推导)
题目链接: ACdream 1006题意: 题解:纯数学推导。 因为: log2(x+y)=Alog2(x+y)=A log2(x−y)=Blog2(x-y)=B 所以, 2A=x+y2^{A} = x+y 2B=x−y2^{B} = x-y相加一下,2x=2A+2B2x=2^{A}+2^{B} 所以,x=2A+2B2=2A−1+2B−1x=\frac{2^{A}+2^{B原创 2017-06-23 15:51:33 · 399 阅读 · 0 评论