摘要: #include<bits/stdc++.h> // #include<iostream> // #include<stdio.h> // #include<iomanip> // #include<stack> // #include<queue> // #include<algorithm> / 阅读全文
posted @ 2019-06-06 21:26 cherish__lin 阅读(194) 评论(0) 推荐(0) 编辑
摘要: 一、给定URL, 提取小说文本 import re import requests from bs4 import BeautifulSoup if __name__ == '__main__': response = requests.get('http://www.jinyongwang.com 阅读全文
posted @ 2020-12-04 10:09 cherish__lin 阅读(448) 评论(0) 推荐(0) 编辑
摘要: 一、给定url,直接下载到本地 import re import requests from bs4 import BeautifulSoup def get_gif(url, a): response = requests.get(url) # 自己电脑上的文件夹路径,默认命名 a.gif wit 阅读全文
posted @ 2020-12-02 15:08 cherish__lin 阅读(182) 评论(0) 推荐(0) 编辑
摘要: CF1秒跑8e9的秘密武器 #pragma GCC optimize("Ofast,unroll-loops")#pragma GCC target("avx,avx2,sse,sse2") 阅读全文
posted @ 2020-11-20 11:15 cherish__lin 阅读(92) 评论(0) 推荐(0) 编辑
摘要: 参考链接:https://blog.csdn.net/qq_43472263/article/details/104150940 U41492 树上数颜色 https://www.luogu.com.cn/problem/U41492 求子树的颜色数有多少种 /* U41492 树上数颜色 计算v的 阅读全文
posted @ 2020-10-09 21:21 cherish__lin 阅读(234) 评论(0) 推荐(0) 编辑
摘要: A - 数列分块入门 1 LibreOJ - 6277 分块模板题:lazy[i] 表示第i块整体的更新量 单点询问:res = a[x] + lazy[belong[x]] #include<map> #include<set> #include<cmath> #include<deque> #i 阅读全文
posted @ 2020-08-26 14:23 cherish__lin 阅读(141) 评论(0) 推荐(0) 编辑
摘要: Princess CJB has lived almost her entire life in the isolated town of Ertona, where CJB uses her unique ability to recognize where crystals of materia 阅读全文
posted @ 2020-07-28 19:57 cherish__lin 阅读(130) 评论(0) 推荐(0) 编辑
摘要: BaoBao is a good student who loves reading, but compared with his huge bookshelf containing lots and lots of books, his reading desk, which can only h 阅读全文
posted @ 2020-03-30 14:35 cherish__lin 阅读(235) 评论(0) 推荐(0) 编辑
摘要: https://lpc.ucfprogrammingteam.org/localFiles/local2019Problems.pdf(G题) 万物皆可网络流,冲冲冲 #include<map> #include<set> #include<cmath> #include<deque> #inclu 阅读全文
posted @ 2020-03-23 11:12 cherish__lin 阅读(198) 评论(0) 推荐(0) 编辑
摘要: 狄利克雷卷积 定义 设f,g为两个数论函数. 定义卷积运算(f×g)(n)=∑d|n[f(d)∗g(n/d)] 运算律 交换律:f×g=g×f 结合律:(f×g)×h=f×(g×h) 存在单位元ι使得f=ι×f 根据定义. (ι×f)(n)=∑d|nι(d)∗f(nd)=f(n) 所以可知. l(n 阅读全文
posted @ 2020-02-04 15:16 cherish__lin 阅读(94) 评论(0) 推荐(0) 编辑
摘要: There is a legendary tale about Dragon Balls on Planet X: if one collects seven Dragon Balls, the Dragon God will show up and help you fulfill your wi 阅读全文
posted @ 2020-02-03 15:05 cherish__lin 阅读(324) 评论(0) 推荐(0) 编辑