递推
algzjh
这个作者很懒,什么都没留下…
展开
-
生成1~n的排列
#include<iostream> #include<cstdio> #include<vector> #include<map> #include<set> #include<queue> #include<cmath> #include<string> #include<cstring> #include<algorithm> using namespace std; typedef long原创 2017-07-30 11:50:10 · 563 阅读 · 0 评论 -
递推总结
卡特兰数: f(n)=Cn2nn+1=(2n)!n!(n+1)!f(n)=\dfrac{C_{2n}^n}{n+1}=\dfrac{(2n)!}{n!(n+1)!} f(n+1)=4n−6nf(n)f(n+1)=\dfrac{4n-6}{n}f(n)原创 2017-07-30 11:22:39 · 508 阅读 · 0 评论 -
CodeForces 621B
B. Wet Shark and Bishops time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Today, Wet Shark is given n bishops on a 1原创 2016-08-22 15:10:45 · 316 阅读 · 0 评论 -
HDU6172-Array Challenge
Array ChallengeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 153428/153428 K (Java/Others) Total Submission(s): 60 Accepted Submission(s): 24Problem Description There’s an array that is原创 2017-08-24 19:56:25 · 1165 阅读 · 0 评论 -
HDU6130-Kolakoski
KolakoskiTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 386 Accepted Submission(s): 184Problem Description This is Kolakosiki sequence:原创 2017-08-15 21:17:24 · 726 阅读 · 0 评论 -
矩阵快速幂求斐波那契数列
#include <iostream> #include <vector> #include <algorithm> #include <cstdio> using namespace std; typedef long long LL; const int MAXN=1e4+5; const int MOD=1e9+7; typedef vector<int> vec; typedef vect原创 2017-08-31 15:43:25 · 404 阅读 · 0 评论 -
矩阵的幂的和
示例题目: POJ3233Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072K Total Submissions: 24251 Accepted: 10081 DescriptionGiven a n × n matrix A and a positive integer k, find the sum原创 2017-08-31 15:53:39 · 461 阅读 · 0 评论 -
2018 “百度之星”程序设计大赛 - 初赛(A)
1001度度熊拼三角 #include&lt;iostream&gt; #include&lt;cstdio&gt; #include&lt;cmath&gt; #include&lt;cstdlib&gt; #include&lt;cstring&gt; #include&lt;vector&gt; #incl原创 2018-08-11 22:07:34 · 406 阅读 · 0 评论 -
HDU6395-Sequence
传送门 STL自带大常数 (ಥ﹏ಥ) #include<bits/stdc++.h> #define MOD 1000000007 using namespace std; typedef long long LL; typedef pair<int,int> PII; const int MAXN = 1e5+5; const int INF = 0x3f3f3f3...原创 2018-08-21 09:41:27 · 214 阅读 · 0 评论