Stephen_F - 博客园

2018年11月9日

摘要： "传送门" include include include include include define re register using namespace std ; const int maxn = 5 1e5 + 4 ; inline int read () { int f = 1 , x 阅读全文

posted @ 2018-11-09 09:34 Stephen_F 阅读(295) 评论(0) 推荐(0)

洛谷P3375KMP字符串匹配

摘要： "传送门" include include include include include define re register using namespace std; const int maxn = 1000005; inline long long read() { char ch = ge 阅读全文

posted @ 2018-11-09 09:10 Stephen_F 阅读(122) 评论(0) 推荐(0)

洛谷P2613有理数取余

摘要： "传送门" 阅读全文

posted @ 2018-11-09 08:58 Stephen_F 阅读(146) 评论(0) 推荐(0)

洛谷树状数组1、2

摘要： "传送门" 树状数组1 include include include include include define re register using namespace std; inline long long read() { char ch = getchar(); long long f 阅读全文

posted @ 2018-11-09 08:38 Stephen_F 阅读(178) 评论(0) 推荐(0)

洛谷线段树1、2

摘要： "传送门" include include include include include define re register define lson (o 1 ) using namespace std; inline long long read(){ char ch = getchar(); 阅读全文

posted @ 2018-11-09 08:13 Stephen_F 阅读(243) 评论(0) 推荐(0)

2018年11月8日

洛谷P4549裴蜀定理

摘要： "传送门" include include include include include include define re register using namespace std; inline int read(){ char ch = getchar(); int f = 1 , x = 阅读全文

posted @ 2018-11-08 21:36 Stephen_F 阅读(174) 评论(0) 推荐(0)

洛谷P3383线性筛素数

摘要： "传送门" 代码中体现在那个 $ break $ $ prime $ 数组中的素数是递增的,当 $ i $ 能整除 $ prime[j ] $ ，那么 $ i prime[j+1] $ 这个合数肯定被 $ prime[j] $ 乘以某个数筛掉。因为i中含有 $ prime[j] $ , $ pr 阅读全文

posted @ 2018-11-08 21:28 Stephen_F 阅读(178) 评论(0) 推荐(0)

洛谷P1177快速排序

摘要： "传送门" include include include include using namespace std; int n; long long a[100005]; inline void quick_sort(int l,int r) { int i = l , j = r ; int m 阅读全文

posted @ 2018-11-08 21:10 Stephen_F 阅读(248) 评论(0) 推荐(0)

洛谷P3811乘法逆元

摘要： "传送门" 线性递推 include include include include include define re register using namespace std; const int maxn = 3000005; int n; long long mod; int p[maxn] 阅读全文

posted @ 2018-11-08 21:07 Stephen_F 阅读(134) 评论(0) 推荐(0)

洛谷P3367并查集

摘要： "传送门" include include include include include include define re register using namespace std; const int maxn = 10005; const int maxm = 200005; inline 阅读全文

posted @ 2018-11-08 20:36 Stephen_F 阅读(165) 评论(0) 推荐(0)

大飞的小屋

公告