夜-> - 博客园

2013年6月2日

摘要： 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 阅读全文

posted @ 2013-06-02 21:11 夜-> 阅读(217) 评论(0) 推荐(0)

TopCoder SRM 457 TheHexagonsDivOne

摘要：容斥组合排列代码：#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<= 阅读全文

posted @ 2013-06-02 15:30 夜-> 阅读(185) 评论(0) 推荐(0)

2013年5月31日

TopCoder SRM 176 Deranged

摘要：代码：#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 阅读全文

posted @ 2013-05-31 21:28 夜-> 阅读(249) 评论(0) 推荐(0)

TopCoder SRM 390 SetOfPatterns

摘要：自己憋了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>/ 阅读全文

posted @ 2013-05-31 19:54 夜-> 阅读(281) 评论(0) 推荐(0)

hdu 3870 Catch the Theves

摘要： 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 阅读全文

posted @ 2013-05-31 15:36 夜-> 阅读(174) 评论(0) 推荐(0)

2013年5月30日

TopCoder SRM 382 CharmingTicketsEasy

摘要：这题的主要算法是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 阅读全文

posted @ 2013-05-30 11:36 夜-> 阅读(368) 评论(0) 推荐(0)

SPOJ 6285. Another Game With Numbers

摘要： 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 阅读全文

posted @ 2013-05-30 09:18 夜-> 阅读(251) 评论(0) 推荐(0)

TopCoder TCHS 16 Divisibility

摘要：容斥原理第三题要注意求最小公倍数时会超 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>// 阅读全文

posted @ 2013-05-30 08:53 夜-> 阅读(208) 评论(0) 推荐(0)

TopCoder SRM 477 CarelessSecretary

摘要：组合+错排代码：#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 阅读全文

posted @ 2013-05-30 08:22 夜-> 阅读(274) 评论(0) 推荐(0)

2013年5月29日

UVa 11806 - Cheerleaders

摘要： 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> 阅读全文

posted @ 2013-05-29 19:45 夜-> 阅读(175) 评论(0) 推荐(0)

公告