数学
forwiat
脚踏实地,仰望星空
展开
-
排列组合列出所有情况之类的问题
举个例子,有5名同学,男生刚开始是0人,女生5人(假设女生之间没区别)将他们进行排列组合,然后男生不断加1,再进行排列组合,直到男生人数为5.男生用1表示,女生用0表示,一:0 0 0 0 0 二:1 0 0 0 0 , 0 1 0 0 0 , 0 0 1 0 0 ,0 0 0 1 0, 0 0 0 0 1三:1 1 0 0 0 , ....... (太多了,不想写了。原创 2016-05-07 17:40:53 · 2577 阅读 · 0 评论 -
Codeforces Round #306 (Div. 2)
C. Divisibility by Eighttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a non-negative integ原创 2017-04-04 00:00:56 · 323 阅读 · 0 评论 -
Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 1)
A. Bear and Pokertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak is an old brown bear. He often play原创 2017-03-24 20:42:00 · 267 阅读 · 0 评论 -
Codeforces Round #313 (Div. 1)
A. Gerald's Hexagontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGerald got a very curious hexagon for h原创 2017-04-09 20:35:16 · 326 阅读 · 0 评论 -
Codeforces Round #382 (Div. 2)
C. Tennis Championshiptime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFamous Brazil city Rio de Janeiro holds a tenn原创 2016-11-28 04:18:33 · 300 阅读 · 0 评论 -
hdu2136 Largest prime factor
Largest prime factorTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11238 Accepted Submission(s): 3976Problem DescriptionEverybod原创 2016-11-25 22:37:13 · 334 阅读 · 0 评论 -
hdu2114 Calculate S(n)
Calculate S(n)Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10756 Accepted Submission(s): 3878Problem DescriptionCalculate S(n原创 2016-11-23 23:14:35 · 372 阅读 · 0 评论 -
hdu 2053Switch Game基础题
Switch GameTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15988 Accepted Submission(s): 9772Problem DescriptionThere are many la原创 2016-11-01 19:27:54 · 396 阅读 · 0 评论 -
hdu1196Lowest Bit水题
Lowest BitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11304 Accepted Submission(s): 8277Problem DescriptionGiven an positive原创 2016-10-19 09:04:31 · 334 阅读 · 0 评论 -
hdu1163Eddy's digital Roots水题
Eddy's digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6266 Accepted Submission(s): 3452Problem DescriptionThe digit原创 2016-10-18 22:40:17 · 319 阅读 · 0 评论 -
hdu1098Ignatius's puzzle泰勒展开/二项式展开
Ignatius's puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9049 Accepted Submission(s): 6288Problem DescriptionIgnatius is原创 2016-10-18 21:23:20 · 837 阅读 · 0 评论 -
2016acmicpc现场赛大连赛区D题
由原式可假设:k*x1+k*x2=a;k*x1*x2=b;得a=(x1+x2)*k;b=x1*x2*k;得gcd(a,b)=k;很多人可能不懂这是为什么,这里我给出证明及结论结论:x1与x2互质,则x1+x2与x1*x2互质证明:反证法,假设x1+x2与x1*x2不互质,则意味着x1*x2与x1+x2有公因子,设为m,x1*x2=k1*m;x1+x2=k2*m;可以得出式子:x原创 2016-10-18 12:51:10 · 558 阅读 · 0 评论 -
hdu1042 N!(高精度水过)
N!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 76906 Accepted Submission(s): 22482Problem DescriptionGiven an integer N(0 ≤原创 2016-11-06 22:03:12 · 304 阅读 · 0 评论 -
Catalan数基础及应用
问题描述:卡塔兰数,是组合数学中一个常出现在各种计数问题中出现的数列。输入一个整数n,计算h(n)。其递归式如下:h(n)= h(0)*h(n-1)+h(1)*h(n-2) + ... + h(n-1)h(0) (其中n>=2,h(0) = h(1) = 1) 该递推关系的解为:h(n)=C(2n,n)/(n+1) (n=1,2,3,...) 思路:直接根据递归式,转载 2016-09-03 14:33:48 · 269 阅读 · 0 评论 -
HDU 5512Pagodas扩欧+容斥原理
PagodasTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 677 Accepted Submission(s): 510Problem Descriptionn pagodas were sta原创 2016-07-30 14:54:52 · 929 阅读 · 0 评论 -
Codeforces Round #319 (Div. 1)
A. Vasya and Petya's Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya and Petya are playing a simp原创 2017-04-18 14:01:57 · 481 阅读 · 0 评论