摘要： http://www.spoj.com/problems/MSKYCODE/容斥原理在我不断的优化过后，终于过了代码：#include <iostream>#include <cstdio>#include <map>#include <algorithm>#include <cstring>#include <string>#include <vector>#define ll long longusing namespace std;const int N=10005;const long long LIN 阅读全文

摘要： 容斥 组合排列代码：#include <iostream>#include <cstdio>#include <map>#include <algorithm>#include <cstring>#include <string>#define ll long longusing namespace std;const int N=1005;const long long LINF=(long long)(1e18);ll c[N][N];ll a[N];void FC(int n){ for(int i=0;i<= 阅读全文

摘要： 代码：#include<iostream>#include<cstring>#include<cstdio>#include<string>#include<set>#include<map>#include<cmath>#include<algorithm>#include<vector>#include<cmath>#include<queue>#include<stack>//#define ull unsigned long long#defi 阅读全文

摘要： 自己憋了N久也没思路，看了一下别人的代码，神呀，这就是差距呀，继续努力。代码：#include<iostream>#include<cstring>#include<cstdio>#include<string>#include<set>#include<map>#include<cmath>#include<algorithm>#include<vector>#include<cmath>#include<queue>#include<stack>/ 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=3870最大流 转换成 最小割 最小割 转换成 最短路代码：#include<iostream>#include<cstring>#include<cstdio>#include<string>#include<set>#include<map>#include<cmath>#include<algorithm>#include<vector>#include<cmath>#include&l 阅读全文

摘要： 这题的主要算法是DP 只在最后结果上用了一下容斥原理代码：#include<iostream>#include<cstring>#include<cstdio>#include<string>#include<set>#include<map>#include<cmath>#include<algorithm>#include<vector>#include<cmath>#include<queue>#include<stack>//#define u 阅读全文

摘要： http://www.spoj.com/problems/NGM2/容斥原理 第四题 水！ 难题各种各样，水题都一个样，无语。代码：#include<iostream>#include<cstring>#include<cstdio>#include<string>#include<set>#include<map>#include<cmath>#include<algorithm>#include<vector>#include<cmath>#include<queu 阅读全文

摘要： 容斥原理 第三题 要注意求最小公倍数时会超 long long 的问题代码：#include<iostream>#include<cstring>#include<cstdio>#include<string>#include<set>#include<map>#include<cmath>#include<algorithm>#include<vector>#include<cmath>#include<queue>#include<stack>// 阅读全文

摘要： 组合+错排代码：#include<iostream>#include<cstring>#include<cstdio>#include<string>#include<set>#include<map>#include<cmath>#include<algorithm>#include<vector>#include<cmath>#include<queue>#include<stack>//#define ull unsigned long long 阅读全文

摘要： http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=226&problem=2906&mosmsg=Submission+received+with+ID+11832924容斥原理 第二题 水！代码：#include<iostream>#include<cstring>#include<cstdio>#include<string>#include<set> 阅读全文