L_H_L的博客

题目链接用二分法来解方程，但是解同类问题时要注意方程是否有唯一解#include <iostream> #include <cstring>#include <cstdio>#include <algorithm>#include <string>#include <string.h>#include <cmath>#include <sstream>#include <set>

题目链接#include <iostream>#include <queue>#include <functional>using namespace std;typedef long long LL;const int MOD = 1e9 + 7;const int maxn = 10010;LL pre[maxn], fac[maxn];LL t, n, k;void init()

题目连接博客连接卡特兰数#include<iostream>#include<cstdio>#include<cstring>using namespace std;int a[110][110]; //大数卡特兰数int b[110]; //卡特兰数的长度 void Catalan(){ //求卡特兰数 int i,j,len,carry,tmp;