<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Coldfresh的博客]]></title><description><![CDATA[keeeeeep！~]]></description><link>https://blog.youkuaiyun.com/Coldfresh</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Coldfresh]]></copyright><item><title><![CDATA[aarch64寄存器相关]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/134407172</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/134407172</guid><author>Coldfresh</author><pubDate>Tue, 14 Nov 2023 20:25:04 +0800</pubDate><description><![CDATA[寄存器esr_el1是在权限级EL1下可以访问的系统寄存器，即由操作系统内核访问来查明具体触发异常原因的寄存器。当飞腾CPU在EL0/EL1状态下，发生异常，并跳入EL1进行异常处理时，该寄存器的相关状态就表明了异常发生的具体原因。EC一共占6位，当EC=0b010101时，表示从AArch64状态的用户程序执行SVC指令而触发的异常，即系统调用。系统调用是一种同步异常。ISS是25位，当EC有明确异常分类并且IL=0b1时，这25位就保留。在AArch64状态下，该寄存器是一个64位的系统寄存器。]]></description><category></category></item><item><title><![CDATA[c语言宏相关高级用法]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/134029220</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/134029220</guid><author>Coldfresh</author><pubDate>Wed, 25 Oct 2023 10:45:22 +0800</pubDate><description><![CDATA[记录一些c语言宏相关的高级用法我们对Markdown编辑器进行了一些功能拓展与语法支持，除了标准的Markdown编辑器功能，我们增加了如下几点新功能，帮助你用它写博客：语法格式
解释
这个函数的第一个参数必须是常量表达式，因为之前我已经说过，它属于编译时行为，而非运行时行为，跟sizeof和typeof一样。这个函数是一个谓词函数，如果const_expr的结果非0，那么生成exp1，且返回类型type也与exp1表达式的类型一致；否则生成exp2，并且返回类型type也与exp2的类型一致。由于是编译时]]></description><category></category></item><item><title><![CDATA[汇编基础学习]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/115919840</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/115919840</guid><author>Coldfresh</author><pubDate>Tue, 20 Apr 2021 21:40:39 +0800</pubDate><description><![CDATA[几个寄存器的介绍：ax,bx,cx,dx,cs,ds,ssax,bx,cx,dx,cs,ds,ssax,bx,cx,dx,cs,ds,ss

]]></description><category></category></item><item><title><![CDATA[pandas相关操作]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/109845922</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/109845922</guid><author>Coldfresh</author><pubDate>Fri, 20 Nov 2020 13:15:55 +0800</pubDate><description><![CDATA[从csv或execl导入pandas（也就是Dataframe）：
import pandas as pd
csv_file_path = '某个csv文件.csv'#这里以csv文件举例，具体哪个文件都差不多
data = pd.read_csv(csv_file_path)#显然默认data都是DataFrame对象

想导入特定的列：
data = pd.read_csv(csv_file_path,usecols=[0,1,2,3])
#usecols是传入的的数组，指定想要的的列，如果的是单列，比]]></description><category></category></item><item><title><![CDATA[【2019 南昌网络赛】The Nth Item（分块）]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/101038219</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/101038219</guid><author>Coldfresh</author><pubDate>Thu, 19 Sep 2019 22:07:53 +0800</pubDate><description><![CDATA[For a series F:
F(0)=0,F(1)=1F(n)=3∗F(n−1)+2∗F(n−2),(n≥2)\displaystyle \begin{gathered} F(0) = 0,F(1) = 1\\ F(n) = 3*F(n-1)+2*F(n-2),(n \geq 2) \end{gathered}F(0)=0,F(1)=1F(n)=3∗F(n−1)+2∗F(n−2),(n≥2)​...]]></description><category></category></item><item><title><![CDATA[【2019 南昌网络赛】Hello 2019（线段树、矩阵、dp）]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/101035318</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/101035318</guid><author>Coldfresh</author><pubDate>Thu, 19 Sep 2019 20:38:11 +0800</pubDate><description><![CDATA[A digital string is “good”: when it contains a subsequence 91029102 and does not contain a subsequence 81028102.
The bad value of a string is defined as how many characters are to remove at least, so ...]]></description><category></category></item><item><title><![CDATA[【2019徐州网络赛 I】query（二维偏序）]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/100786566</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/100786566</guid><author>Coldfresh</author><pubDate>Thu, 12 Sep 2019 23:18:21 +0800</pubDate><description><![CDATA[Given a permutation pp of length nn, you are asked to answer mm queries, each query can be represented as a pair (l ,r )(l,r), you need to find the number of pair(i ,j)(i,j) such that $l≤i&lt;j≤r and&...]]></description><category></category></item><item><title><![CDATA[【2019徐州网络赛 G】Colorful String（PAM）]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/100782819</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/100782819</guid><author>Coldfresh</author><pubDate>Thu, 12 Sep 2019 20:33:56 +0800</pubDate><description><![CDATA[The value of a string s is equal to the number of different letters which appear in this string.
Your task is to calculate the total value of all the palindrome substring.
Input
The input consists of ...]]></description><category></category></item><item><title><![CDATA[P5496 【模板】回文自动机（PAM）]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/100781434</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/100781434</guid><author>Coldfresh</author><pubDate>Thu, 12 Sep 2019 19:27:51 +0800</pubDate><description><![CDATA[题目背景
模板题，无背景（其实是我想不出背景）。
题目描述
给定一个字符串 s。保证每个字符为小写字母。对于 s 的每个位置，请求出以该位置结尾的回文子串个数。
这个字符串被进行了加密，除了第一个字符，其他字符都需要通过上一个位置的答案来解密。
具体地，若第 ii(i≥1) 个位置的答案是 k，第 i+1 个字符读入时的 ASCII 码为 c，则第 i+1 个字符实际的 ASCII 码为 (c−9...]]></description><category></category></item><item><title><![CDATA[【HDU3948】The Number of Palindromes（PAM）]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/100776745</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/100776745</guid><author>Coldfresh</author><pubDate>Thu, 12 Sep 2019 16:48:48 +0800</pubDate><description><![CDATA[问题是问本质不同的回文串的个数，回文树的模版题
代码：
#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt;queue&gt;
#include&lt;cstring&gt;
#define maxx 100005
#define N 26
using namespace std;
typedef long long ll;
st...]]></description><category></category></item><item><title><![CDATA[1028 大数乘法 V2（NTT or FTT）]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/100526113</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/100526113</guid><author>Coldfresh</author><pubDate>Tue, 03 Sep 2019 19:49:47 +0800</pubDate><description><![CDATA[给出2个大整数A,B，计算A*B的结果。
输入
第1行：大数A
第2行：大数B
(A,B的长度 &lt;= 100000，A,B &gt;= 0）
输出
输出A * B
输入样例
123456
234567
输出样例
28958703552
纯粹想试一下我弄的NTT的板子的准确性
#include&lt;iostream&gt;
#include&lt;cstdio&gt;
#include&lt...]]></description><category></category></item><item><title><![CDATA[P3834 【模板】可持久化线段树 1（主席树）]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/99861958</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/99861958</guid><author>Coldfresh</author><pubDate>Tue, 20 Aug 2019 17:08:01 +0800</pubDate><description><![CDATA[就是查询数组区间静态第k小，怎么感觉比线段树还好写
代码：
#include&lt;stdio.h&gt;
#include&lt;iostream&gt;
#include&lt;cstring&gt;
#include&lt;algorithm&gt;
#include&lt;queue&gt;
#include&lt;cmath&gt;
#include&lt;vector&gt;
#inc...]]></description><category></category></item><item><title><![CDATA[P3369 【模板】普通平衡树(fhq treap)]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/98877028</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/98877028</guid><author>Coldfresh</author><pubDate>Thu, 08 Aug 2019 17:00:45 +0800</pubDate><description><![CDATA[题目描述
您需要写一种数据结构（可参考题目标题），来维护一些数，其中需要提供以下操作：
插入xx数
删除xx数(若有多个相同的数，因只删除一个)
查询xx数的排名(排名定义为比当前数小的数的个数+1。若有多个相同的数，因输出最小的排名)
查询排名为xx的数
求xx的前驱(前驱定义为小于xx，且最大的数)
求xx的后继(后继定义为大于xx，且最小的数)
输入格式
第一行为nn，表示操作的个数,下面n...]]></description><category></category></item><item><title><![CDATA[【HDU 6607】Easy Math Problem(杜教筛+min25筛+拉格朗日插值)]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/98668028</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/98668028</guid><author>Coldfresh</author><pubDate>Tue, 06 Aug 2019 22:12:00 +0800</pubDate><description><![CDATA[Problem Description
One day, Touma Kazusa encountered a easy math problem. Given n and k, she need to calculate the following sum modulo 1e9+7.
∑i=1n∑j=1ngcd(i,j)klcm(i,j)[gcd(i,j)∈prime]%(1e9+7)∑_{i=...]]></description><category></category></item><item><title><![CDATA[可持久化数组（主席树基础）]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/98518017</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/98518017</guid><author>Coldfresh</author><pubDate>Mon, 05 Aug 2019 21:03:11 +0800</pubDate><description><![CDATA[题目链接
大概是知道了可持久化是什么意思了
代码：
#include&lt;stdio.h&gt;
#include&lt;iostream&gt;
#include&lt;cstring&gt;
#include&lt;algorithm&gt;
#include&lt;queue&gt;
#include&lt;cmath&gt;
#include&lt;vector&gt;
#include...]]></description><category></category></item><item><title><![CDATA[【2019 Multi-University Training Contest 3 】【HDU 6604】Blow up the city(支配树)]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/97817065</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/97817065</guid><author>Coldfresh</author><pubDate>Tue, 30 Jul 2019 21:09:03 +0800</pubDate><description><![CDATA[Time Limit: 5000/5000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Problem Description
Country A and B are at war. Country A needs to organize transport teams to deliver supplies to...]]></description><category></category></item><item><title><![CDATA[P2597 [ZJOI2012]灾难(支配树)]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/97798685</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/97798685</guid><author>Coldfresh</author><pubDate>Tue, 30 Jul 2019 17:06:49 +0800</pubDate><description><![CDATA[题目链接
题目大意就是在一个有向无环图上，具体我也说不清楚，看题目链接。目的学习支配树，支配树分三种，一个是树上，二是有向无环图，三是一般有向图，这里是针对的是有向无环图是的支配树的构造。
代码：
#include&lt;stdio.h&gt;
#include&lt;iostream&gt;
#include&lt;cstring&gt;
#include&lt;algorithm&gt;
#i...]]></description><category></category></item><item><title><![CDATA[【洛谷P5325】 【模板】Min_25筛]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/90715295</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/90715295</guid><author>Coldfresh</author><pubDate>Fri, 31 May 2019 14:15:06 +0800</pubDate><description><![CDATA[n的范围是小于101010^{10}1010
抛弃ees和洲阁筛，拥抱min_25
代码：
#include&lt;cstdio&gt;
#include&lt;cstring&gt;
#include&lt;iostream&gt;
#include&lt;cmath&gt;
#include&lt;vector&gt;
#include&lt;algorithm&gt;
#define IN...]]></description><category></category></item><item><title><![CDATA[【CodeForces - 1139D】Steps to One(期望dp，容斥)]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/90046387</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/90046387</guid><author>Coldfresh</author><pubDate>Thu, 09 May 2019 19:45:13 +0800</pubDate><description><![CDATA[Vivek initially has an empty array a and some integer constant m.
He performs the following algorithm:
1.Select a random integer x uniformly in range from 1 to m and append it to the end of a.
Compute...]]></description><category></category></item><item><title><![CDATA[【CodeForces - 1154G】Minimum Possible LCM（涉及数论很多东西。。）]]></title><link>https://blog.youkuaiyun.com/Coldfresh/article/details/90045995</link><guid>https://blog.youkuaiyun.com/Coldfresh/article/details/90045995</guid><author>Coldfresh</author><pubDate>Thu, 09 May 2019 19:20:00 +0800</pubDate><description><![CDATA[You are given an array a consisting of n integers a1,a2,…,an.
Your problem is to find such pair of indices i,j (1≤i&lt;j≤n) that lcm(ai,aj) is minimum possible.
lcm(x,y) is the least common multiple o...]]></description><category></category></item></channel></rss>