摘要：
"http://acm.hdu.edu.cn/showproblem.php?pid=2089" include include include using namespace std; typedef long long ll; int a[20]; int dp[20][2]; int dfs( 阅读全文
摘要：
需要在一个简答的动态规划上加一点东西 给一些状态数非常多但是重复状态非常多的动规提供了一种可能的解决方法。 include include define N 1000005 using namespace std; int a[N],d[N],stone[N]; int f[N]; int main 阅读全文
摘要：
题目描述 输入二个正整数x0,y0(2 include using namespace std; int m,n,ans; int gcd(int x,int y){ if(!y){return x;} return gcd(y,x%y); } int main(){ cin n m; for(in 阅读全文
摘要：
``` include include include define N 1000005 define inf 0x3f3f3f3f using namespace std; struct node{ int to,nxt,cap; }; int que[N]; int h,qt; struct D 阅读全文
摘要：
``` include include include include include include include include define N 10005 define INF 0x3f3f3f3f define Del(a,b) memset(a,b,sizeof(a)) using n 阅读全文
摘要：
``` include include include include define N 1000005 define inf 0x3f3f3f3f using namespace std; struct Edge{ int to,nxt,cap; }; int que[N]; int h,qt; 阅读全文
摘要：
``` include include include include include include define N 1000005 define inf 0x3f3f3f3f using namespace std; void read(int &s){ char ch=getchar(); 阅读全文
摘要：
\href{http://www.lydsy.com/JudgeOnline/problem.php?id=1101}{BZOJ 1101 [POI2007]Zap}\\ 这种形式的式子在之前的文章中出现过不少。\\ 将题目中的式子反演化简到最后会得到一个式子: \begin{equation} a 阅读全文