摘要:
#include #include using namespace std; int fac[10],a[10]; #define db double db p[10],f[10]; int n,m; void dfs(int now,int remain) { if(now==m) { a[now]=remain; //dfs出 int ... 阅读全文
摘要:
#include #include #include #include #include using namespace std; const int mod=13; int a[510][200*100+10]; int x[510],id[201][201]; inline int gcd(int a,int b) { while(b!=0) { in... 阅读全文
摘要:
#include #include #include using namespace std; const int maxn=1e5+10; struct point{ double x,y; void in() { scanf("%lf%lf",&x,&y); } inline point f(point a)const{ ... 阅读全文
摘要:
#include #include #include #include #include #include using namespace std; #define LL long long const int maxn=25; double a[maxn],l[maxn],r[maxn]; double ex,ey; #define dis(x1,y1,x2,y2) hypot(x1... 阅读全文
摘要:
http://blog.codinglabs.org/articles/linear-algebra-for-recursion.html 另附一个知识点 https://www.zhihu.com/question/35094617 有时间了学学 可能和CCF14F有关系 另介绍一种算法 Berl 阅读全文
摘要:
#!/bin/sh # put the code and data in the same folder in="in" #data's inputs file suffix out="out" #Analogy above cpp="a.cpp" # the CPP of yours.BTW you should comment the freopen prog="... 阅读全文
摘要:
#include using namespace std; const int INF = 0x3f3f3f3f; const int MAXN = 1e5+7; int n,m,k; bool vis[MAXN]; long long dist[MAXN][11]; struct qnode{ int v; int c; qnode(){} qnod... 阅读全文
摘要:
#include #include #include using namespace std; #define LL long long const int maxn=1e3+10; #define inf 0x3f3f3f3f int n,d; int cnt[51]; int t1,t2,t12; double dp[12][12][12]; LL c[51][51]; double df... 阅读全文
摘要:
#include #include #include #include #include #include using namespace std; #define LL long long const int maxn=3e5+10; LL a[maxn]; LL odd[maxn]; LL even[maxn]; LL sum[maxn]; int main() { ... 阅读全文