- 博客(23)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 Codeforces 659G Fence Divercity (组合计数)
#include #include #include #include #include #include #include #include #include using namespace std; #define inf 0x3f3f3f3f#define N 1000020#define M 1000020#define
2016-03-31 15:43:16
594
原创 Codeforces 145D Lucky Pair (组合计数)
#include #include #include #include #include #include #include #include #include using namespace std; #define inf 0x3f3f3f3f#define N 1000020#define M 1000020#define
2016-03-31 14:55:33
613
原创 Codeforces 396D On Sum of Number of Inversions in Permutations (逆序对计数)
#include #include #include #include #include #include #include #include #include using namespace std; #define inf 0x3f3f3f3f#define N 1000020#define M 1000020#define
2016-03-25 13:21:12
684
原创 Codeforces 201E Thoroughly Bureaucratic Organization (智商题。。)
#include #include #include #include #include #include #include #include #include using namespace std; #define inf 0x3f3f3f3f#define N 10000020#define M 1000020#define
2016-03-25 11:11:27
574
原创 Codeforces 585E Present for Vitalik the Philatelist (莫比乌斯反演)
#include #include #include #include #include #include #include #include #include using namespace std; #define inf 0x3f3f3f3f#define N 10000020#define M 1000020#define
2016-03-24 18:32:53
558
原创 Codeforces 235E Number Challenge (莫比乌斯反演)
#include #include #include #include #include #include #include #include #include using namespace std; #define inf 0x3f3f3f3f#define N 4000020#define M 1000020#define
2016-03-24 15:53:36
405
原创 Codeforces 306C White, Black and White Again (简单计数)
#include #include #include #include #include #include #include #include #include using namespace std; #define inf 0x3f3f3f3f#define N 8020#define M 1000020#define LL
2016-03-24 15:17:38
660
原创 Codeforces 140E New Year Garland (dp + 容斥)
#include #include #include #include #include #include #include #include #include using namespace std; #define inf 0x3f3f3f3f#define N 5020#define M 1000020#define LL
2016-03-24 14:35:22
601
原创 Codeforces 367E Sereja and Intervals (dp + sqrt)
#include #include #include #include #include #include #include #include #include using namespace std; #define inf 0x3f3f3f3f#define N 100020#define LL long long#defin
2016-03-24 12:52:44
312
原创 Codeforces 283E Cow Tennis Tournament (扫描线+计数)
#include #include #include #include #include #include #include #include #include using namespace std; #define inf 0x3f3f3f3f#define N 100020#define LL long long#defin
2016-03-24 11:18:56
437
原创 Codeforces 15E Trangles (计数)
#include #include #include #include #include #include #include #include #include using namespace std; #define inf 0x3f3f3f3f#define N 1020#define LL long long#define
2016-03-24 10:32:08
507
原创 Codeforces 40E Number Table (计数)
#include #include #include #include #include #include using namespace std;#define N 1020#define M 400030#define mod 1000000007#define B 234324#define LL long longint n, m, p, k;bool swp
2016-03-23 13:46:17
501
原创 Codeforces 285E Positions in Permutations (dp + 容斥)
#include #include #include #include #include #include using namespace std;#define N 1020#define M 400030#define mod 1000000007#define B 234324#define LL long longint f[N][N][4];int fac
2016-03-23 12:56:49
572
原创 Codeforces 383E Vowels (容斥+莫比乌斯变换)
By doubility, contest: Codeforces Round #225 (Div. 1), problem: (E) Vowels, Accepted, # #include #include #include #include #include #include using namespace std;const int N = 1 << 24;#defin
2016-03-22 22:38:06
940
原创 Codeforces 283B Distinct Paths (dfs+剪枝)
#include #include #include #include #include #include using namespace std;#define N 20#define M 400030#define mod 1000000007#define B 234324#define LL long longint n, m, k;int a[N][N];
2016-03-22 22:35:38
465
原创 Codeforces 645E Intellectual Inquiry (dp不同子序列计数)
#include #include #include #include #include #include using namespace std;#define N 2000030#define M 15000030#define mod 1000000007char s[N];int n, k;int pre[26];int f[N];int main()
2016-03-21 11:02:04
512
原创 Codeforces 645F Cowslip Collections (莫比乌斯反演)
#include #include #include #include #include #include using namespace std;#define N 1000030#define M 15000030#define mod 1000000007int n, k, q;int f[N], nf[N];int p[N], cnt, np[N], mu[N]
2016-03-21 11:00:35
639
原创 TC SRM518 NIM (FWT)
求一个变换tftf，使得tf(A⊕B)=tf(A)⋅tf(B)tf( A \oplus B) = tf(A) \cdot tf(B) 构造tftf和逆变换utfutf, tf(a,b)=(a−b,a+b)tf( a , b ) = (a - b, a + b) tf(X1,X2)=(tf(X1)−tf(X2),tf(X1)+tf(X2)) tf(X_1, X_2) = (tf(X_1)-tf(X
2016-03-18 15:24:59
900
原创 Codeforces 300D Painting Square (FFT)
#include #include #include #include #include #include #include #include #include #include using namespace std;using namespace std::tr1;#define N 60020#define LL long long#define ls (i
2016-03-15 20:25:29
817
原创 Codeforces 623E Transforming Sequence (分治+FFT)
#include #include #include #include using namespace std;#define N 200020#define LL long long#define MOD 1000000007#define K 3#define G 3// 1000000000000000000 30000int m[] = {1004535809,
2016-03-15 20:22:03
1012
原创 Codeforces 472G Design Tutorial: Increase the Constraints(分块+FFT)
#include #include #include #include using namespace std;#define N 550020#define LL long long#define MOD 1000000007#define K 3#define G 3const int B = 6000;int n, m;char s[N], t[N];in
2016-03-15 20:20:19
549
原创 51nod 1387 移数字(多项式除法）
#include #include #include #include #include #include #include #include #include #include #include using namespace std;#define N 200200#define M 1000020#define LL long long#define inf
2016-03-15 20:16:43
1026
原创 bzoj 3625 小朋友和二叉树 多项式开根
常数大到飞起。O(nlogn)的算法在CF上跑了2000ms也是神奇。有空看下怎么常数写小一点。。#include #include #include #include #include #include #include #include #include #include using namespace std;using
2016-03-09 19:37:21
1178
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人