<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[py_2017的博客]]></title><description><![CDATA[懒……]]></description><link>https://blog.youkuaiyun.com/py_2017</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; py_2017]]></copyright><item><title><![CDATA[shell常用命令]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/122385714</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/122385714</guid><author>py_2017</author><pubDate>Sat, 08 Jan 2022 20:27:40 +0800</pubDate><description><![CDATA[文章目录shell常用命令说明基本命令文件和文件夹搜索相关进程相关权限相关软件相关
shell常用命令
说明
编写环境：darwin(macOS, terminal), zsh
仅列出本人常用命令，详情请自行用man查看
持续更新（大概）
基本命令
man #查看指定指令的详细用法
man ls #查看指令ls的用法

sudo #在命令前加上，获取管理员权限

cd #进入指定路径
cd .. #进入上层路径
cd folder #进入当前路径下的folder文件夹

ls     #查看当前路径下的文件]]></description><category></category></item><item><title><![CDATA[ACM竞赛模版]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/121654782</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/121654782</guid><author>py_2017</author><pubDate>Wed, 01 Dec 2021 14:37:50 +0800</pubDate><description><![CDATA[文章目录常用板子基本模板小数比较快读板子高精度板子（带符号，自适应长度）分数板子组合数板子线筛板子字符串字符串hashKMP O(n)O(n)O(n)Z函数（扩展KMP）后缀数组SA后缀自动机SAMAC自动机数学扩展gcd逆元阶乘逆元 O(n)O(n)O(n)数逆元 O(n)O(n)O(n)矩阵基本模版矩阵快速幂高斯消元矩阵求逆素数判定质因数分解裴蜀定理全排列(prev&amp;next)(prev\&amp;next)(prev&amp;next)错排公式中国剩余定理扩展中国剩余定理Lucas定理欧拉筛快]]></description><category></category></item><item><title><![CDATA[博客搬家了]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/104783938</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/104783938</guid><author>py_2017</author><pubDate>Tue, 10 Mar 2020 21:34:47 +0800</pubDate><description><![CDATA[用了cnblogs感觉挺好的
刚学的css派上用场了= =
然后就搬家了QAQ
新地址也有这里的所有东西喔
新地址https://www.cnblogs.com/2017py/

]]></description><category></category></item><item><title><![CDATA[Codeforces Round #622 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/104472930</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/104472930</guid><author>py_2017</author><pubDate>Mon, 24 Feb 2020 11:25:02 +0800</pubDate><description><![CDATA[Codeforces Round #622 (Div. 2)
A. Fast Food Restaurant
题意
有三种食物，每个客人每样最多拿一个，每个客人拿的组合不能相同，问最多能供应多少个客人
题解
每样最多拿一个，一共有7种取法：a,b,c,ab,ac,bc,abca,b,c,ab,ac,bc,abca,b,c,ab,ac,bc,abc，用7个if判断一下就好了
代码
#include&...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #620 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/104339651</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/104339651</guid><author>py_2017</author><pubDate>Sun, 16 Feb 2020 11:58:56 +0800</pubDate><description><![CDATA[Codeforces Round #620 (Div. 2)
A. Two Rabbits
题意
两只兔子相向而跳，一只一次跳距离a，另一只一次跳距离b，每次同时跳，问是否可能到同一位置
题解
每次跳相对距离减少Δ=(a+b)\Delta=(a+b)Δ=(a+b)，如果总距离是Δ\DeltaΔ的倍数，就证明可以到同一位置
代码
#include&lt;iostream&gt;
#include&l...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #619 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/104323704</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/104323704</guid><author>py_2017</author><pubDate>Sat, 15 Feb 2020 10:29:34 +0800</pubDate><description><![CDATA[Codeforces Round #619 (Div. 2)
A. Three Strings
题意
给定abc三个字符串，c的每一位都必须与a或者b的对应位交换，问交换后的a和b是否可能相等
题解
由于c的每一位都必须交换，而交换后都要与另一个字符串的对应位比较，所以只需循环一遍，判断每一位c是否都能与a或者b对应位中的一个相等即可
代码
#include&lt;iostream&gt;
#in...]]></description><category></category></item><item><title><![CDATA[Educational Codeforces Round 82 (Rated for Div. 2)]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/104300778</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/104300778</guid><author>py_2017</author><pubDate>Thu, 13 Feb 2020 19:16:50 +0800</pubDate><description><![CDATA[Educational Codeforces Round 82 (Rated for Div. 2)
A. Erasing Zeroes
题意
给定一个串01序列，求最少删除多少个0使所有1相邻
题解
找到第一个和最后一个1的位置，统计中间的0的个数即可
代码
#include&lt;iostream&gt;
#include&lt;cstdio&gt;
using namespace std;
...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #618 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/104244550</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/104244550</guid><author>py_2017</author><pubDate>Mon, 10 Feb 2020 11:04:30 +0800</pubDate><description><![CDATA[Codeforces Round #618 (Div. 2)
A. Non-zero
题意
输入n个数，每次可以选定其中的一段数将其所有数+1，该操作可以执行若干次，求至少需要几次将所有数之和跟积都不为0
题解
先满足积不为0，直接统计出原本的0的个数，将其全部+1，然后再判断和是否为0，为0则任选一个数+1
代码
#include&lt;iostream&gt;
#include&lt;cstd...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #616 (Div. 2)]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/104159388</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/104159388</guid><author>py_2017</author><pubDate>Mon, 03 Feb 2020 18:51:50 +0800</pubDate><description><![CDATA[Codeforces Round #616 (Div. 2)
A. Even But Not Even
题意
输入一个位数不超过3000的数，删除其中的若干位，把它变成一个自身为奇数，所有位上的数之和为偶数的数。
题解
用字符串把数存起来，先找到最后一个为奇数的位置，将起后面的全部删掉，然后把剩下的数加起来，如果得到奇数，就在字符串中找一位奇数数将其删掉，最后处理前导零。
代码
#include&...]]></description><category></category></item><item><title><![CDATA[LaTex公式符号]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/78275883</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/78275883</guid><author>py_2017</author><pubDate>Wed, 18 Oct 2017 18:06:09 +0800</pubDate><description><![CDATA[下面这个网站是我认为比较齐全的网站 
http://www.mohu.org/info/symbols/symbols.htm]]></description><category></category></item><item><title><![CDATA[GZOJ 1361. 国王游戏【NOIP2012提高组DAY1】]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/78275697</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/78275697</guid><author>py_2017</author><pubDate>Wed, 18 Oct 2017 17:49:26 +0800</pubDate><description><![CDATA[国王游戏【NOIP2012提高组DAY1】Time Limit:1000MS  Memory Limit:128000KDescription国王游戏（game.cpp/c/pas） 【问题描述】 　　恰逢H国国庆，国王邀请n位大臣来玩一个有奖游戏。首先，他让每个大臣在左、右手上面分别写下一个整数，国王自己也在左、右手上各写一个整数。然后，让这n位大臣排成一排，国王站在队伍的最前面。排好队后，所有的]]></description><category></category></item><item><title><![CDATA[C/C++ 手动开O2]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/77540551</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/77540551</guid><author>py_2017</author><pubDate>Thu, 24 Aug 2017 20:04:55 +0800</pubDate><description><![CDATA[手动O2比赛不能用，平时玩玩就好]]></description><category></category></item><item><title><![CDATA[C++读入输出优化]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/77485517</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/77485517</guid><author>py_2017</author><pubDate>Tue, 22 Aug 2017 20:18:27 +0800</pubDate><description><![CDATA[读入输出优化虽然对于小数据没有半点作用，但是对于大数据来说，可以优化几十ms。 
有时就是那么几十ms，可以被卡掉大数据的点]]></description><category></category></item><item><title><![CDATA[JZOJ 5328. 【NOIP2017提高A组模拟8.22】世界线]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/77485184</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/77485184</guid><author>py_2017</author><pubDate>Tue, 22 Aug 2017 20:09:42 +0800</pubDate><description><![CDATA[5328. 【NOIP2017提高A组模拟8.22】世界线(File IO): input:worldline.in output:worldline.out 
Time Limits: 1500 ms  Memory Limits: 262144 KBDescriptionInputOutputSample Input5 5 
1 2 
1 3 
2 3 
3 4 
4 5Sample Outpu]]></description><category></category></item><item><title><![CDATA[JZOJ 5329. 【NOIP2017提高A组模拟8.22】时间机器]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/77484612</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/77484612</guid><author>py_2017</author><pubDate>Tue, 22 Aug 2017 19:54:22 +0800</pubDate><description><![CDATA[5329. 【NOIP2017提高A组模拟8.22】时间机器(File IO): input:machine.in output:machine.out 
Time Limits: 2000 ms  Memory Limits: 262144 KBDescriptionInputOutputSample Input3 
2 2 
1 4 2 
3 5 1 
1 4 2 
2 5 1 
3 2 
1]]></description><category></category></item><item><title><![CDATA[JZOJ 5326. LCA 的统计 (Standard IO)]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/77482526</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/77482526</guid><author>py_2017</author><pubDate>Tue, 22 Aug 2017 19:40:19 +0800</pubDate><description><![CDATA[5326. LCA 的统计 (Standard IO)Time Limits: 1000 ms  Memory Limits: 131072 KBDescriptionInputOutputSample Input2 2 
1 1Sample Output17Data ConstraintHint题解树形dpdp 
枚举now=lca(i,j)now=lca(i,j)，快速算出符合条件的ii的权值和]]></description><category></category></item><item><title><![CDATA[JZOJ 5307. 【NOIP2017提高A组模拟8.18】偷窃 (Standard IO)]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/77435027</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/77435027</guid><author>py_2017</author><pubDate>Mon, 21 Aug 2017 17:01:09 +0800</pubDate><description><![CDATA[5307. 【NOIP2017提高A组模拟8.18】偷窃 (Standard IO)Time Limits: 1000 ms  Memory Limits: 262144 KBDescriptionInputOutputSample Input5 5 
1 4 0 5 2 
2 1 2 0 1 
0 2 3 4 4 
0 3 0 3 1 
1 2 2 1 1Sample Output9Data Co]]></description><category></category></item><item><title><![CDATA[JZOJ 5286. 【NOIP2017提高A组模拟8.16】花花的森林  (Standard IO)]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/77363724</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/77363724</guid><author>py_2017</author><pubDate>Mon, 21 Aug 2017 08:02:46 +0800</pubDate><description><![CDATA[5286. 【NOIP2017提高A组模拟8.16】花花的森林 (Standard IO)

Time Limits: 1000 ms  Memory Limits: 131072 KB



Description



Input



Output



Sample Input

3 
1 2 3 
1 2 
1 3 
2 
1



Sample Output

6 
9 
6



D]]></description><category></category></item><item><title><![CDATA[JZOJ 5305. 【NOIP2017提高A组模拟8.18】C (Standard IO)]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/77434846</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/77434846</guid><author>py_2017</author><pubDate>Sun, 20 Aug 2017 21:55:45 +0800</pubDate><description><![CDATA[5305. 【NOIP2017提高A组模拟8.18】C (Standard IO)Time Limits: 1000 ms  Memory Limits: 131072 KB  DescriptionInputOutputSample Input10 11 
1 2 
2 3 
3 4 
1 4 
3 5 
5 6 
8 6 
8 7 
7 6 
7 9 
9 10  
6 
1 2 
3 5 
6]]></description><category></category></item><item><title><![CDATA[JZOJ 5257. 小X的佛光 (Standard IO)]]></title><link>https://blog.youkuaiyun.com/py_2017/article/details/77113194</link><guid>https://blog.youkuaiyun.com/py_2017/article/details/77113194</guid><author>py_2017</author><pubDate>Sun, 13 Aug 2017 00:23:00 +0800</pubDate><description><![CDATA[5257. 小X的佛光 (Standard IO)

Time Limits: 2000 ms  Memory Limits: 524288 KB



Description





Input



Output



Sample Input

3 3 1 
1 2 
2 3 
1 2 3 
1 1 3 
3 1 3



Sample Output

1 
1 
3



Data Co]]></description><category></category></item></channel></rss>