coder-yhh的博客

原题链接卡特兰数公式变形一下用分解质因数求组合数解#include<iostream>#include<cmath>#include<vector>using namespace std;typedef long long LL;const int N = 25050;int primes[N], cnt;int sum[N];bool st[N];int x, y;void get_primes(int n)//线性筛{

#include<iostream>#include<vector>#include<algorithm>#include<string>using namespace std;//引用速度快vector<int> add(vector<int>& a, vector<int>& b) { if (a.size() < b.size())return add(b, a); vect.