algzjh的博客

#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

卡特兰数： 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)

B. Wet Shark and Bishopstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday, Wet Shark is given n bishops on a 1

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

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:

#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

示例题目： 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

1001度度熊拼三角#include&amp;lt;iostream&amp;gt;#include&amp;lt;cstdio&amp;gt;#include&amp;lt;cmath&amp;gt;#include&amp;lt;cstdlib&amp;gt;#include&amp;lt;cstring&amp;gt;#include&amp;lt;vector&amp;gt;#incl

传送门STL自带大常数 (ಥ﹏ಥ)#include&lt;bits/stdc++.h&gt;#define MOD 1000000007 using namespace std;typedef long long LL;typedef pair&lt;int,int&gt; PII;const int MAXN = 1e5+5;const int INF = 0x3f3f3f3...