<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ThreeDoves的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ThreeDoves</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ThreeDoves]]></copyright><item><title><![CDATA[valgrind | callgrind查询程序用时，一眼看出优化的强大（性能章）]]></title><link>https://blog.youkuaiyun.com/ThreeDoves/article/details/144700500</link><guid>https://blog.youkuaiyun.com/ThreeDoves/article/details/144700500</guid><author>ThreeDoves</author><pubDate>Tue, 24 Dec 2024 20:23:45 +0800</pubDate><description><![CDATA[只学callgrind使用直接跳到即可你是否在写程序时依赖大量的if-else语句？需要注意的是，大量的if-else语句在数据量大时将会严重拖慢程序速度作为一个C++初学者，我总是觉得这么说很抽象，“”到底是有多严重呢？于是我写了一段代码，现在一步步地教你使用callgrind检查程序速度，你还能在实打实的数据中发现if-else累赘的运算量。]]></description><category></category></item><item><title><![CDATA[valgrind | 调试C/C++程序（基本准备）]]></title><link>https://blog.youkuaiyun.com/ThreeDoves/article/details/144443743</link><guid>https://blog.youkuaiyun.com/ThreeDoves/article/details/144443743</guid><author>ThreeDoves</author><pubDate>Fri, 13 Dec 2024 11:34:21 +0800</pubDate><description><![CDATA[我们往往需要时间复杂度更低、占内存更少的算法(尤其是写算法时，注意到哪里发生错误、是什么微妙差别造成了巨大的性能差距是很重要的)，valgrind就是可以进行C/C++单步耗时监测、内存开销监测等等监测性能的关键工具。]]></description><category></category></item><item><title><![CDATA[C++ 算法 | 快读快写模板]]></title><link>https://blog.youkuaiyun.com/ThreeDoves/article/details/144153456</link><guid>https://blog.youkuaiyun.com/ThreeDoves/article/details/144153456</guid><author>ThreeDoves</author><pubDate>Sat, 30 Nov 2024 13:15:45 +0800</pubDate><description><![CDATA[【代码】C++ 算法 | 快读快写模板。]]></description><category></category></item><item><title><![CDATA[力扣BFS报错Heap-use-after-free解决方案]]></title><link>https://blog.youkuaiyun.com/ThreeDoves/article/details/144054275</link><guid>https://blog.youkuaiyun.com/ThreeDoves/article/details/144054275</guid><author>ThreeDoves</author><pubDate>Tue, 26 Nov 2024 11:34:22 +0800</pubDate><description><![CDATA[最近在刷网格图dfs和bfs的题。之前都没有加引用的习惯，前段时间做一道dfs，做完了和题解思路一致，但却频频超时，查了十几分钟，最后发现是四向方向数组少了个引用，加上后马上通过了……可想而知，如今能引用几乎都尽可能带上了。然而今天这个问题又刚好是滥用引用导致的。]]></description><category></category></item><item><title><![CDATA[Nonebot交互，时间更新在页面外]]></title><link>https://blog.youkuaiyun.com/ThreeDoves/article/details/141786648</link><guid>https://blog.youkuaiyun.com/ThreeDoves/article/details/141786648</guid><author>ThreeDoves</author><pubDate>Sun, 01 Sep 2024 17:10:51 +0800</pubDate><description><![CDATA[打开终端，cd 机器人目录（以E:\Programs\Nonebot为例）时间总是更新在原时间后！后来查了一下，原来是pycharm的输出窗口。所以考虑用nb run（就有了可交互的聊天窗口~]]></description><category></category></item><item><title><![CDATA[Python - pipx 无法将“pipx”项识别为 cmdlet、函数、脚本文件或可运行程序的名称。]]></title><link>https://blog.youkuaiyun.com/ThreeDoves/article/details/141751412</link><guid>https://blog.youkuaiyun.com/ThreeDoves/article/details/141751412</guid><author>ThreeDoves</author><pubDate>Sat, 31 Aug 2024 13:30:53 +0800</pubDate><description><![CDATA[重启pycharm，重新输入pipx install nb-cli。使用pycharm搭建Nonebot脚手架时（此时发生报错，并且关闭终端、新开终端无效。安装pipx后，继续安装脚手架。），在终端输入以下代码安装pipx。]]></description><category></category></item><item><title><![CDATA[py安装库(win32gui)报错：To search for alternate channels that may provide the conda package]]></title><link>https://blog.youkuaiyun.com/ThreeDoves/article/details/141134914</link><guid>https://blog.youkuaiyun.com/ThreeDoves/article/details/141134914</guid><author>ThreeDoves</author><pubDate>Mon, 12 Aug 2024 16:34:17 +0800</pubDate><description><![CDATA[切换到终端输入以上指令，在进行了两次Collecting packages(标准和flexible)后宣告失败。，如果conda install不行，就换成pip install。后者是从Pypl上安装包，相对要全面一点。win32gui和win32con都包含在pywin32内。可以看到，并没有特别安装win32gui和win32con。]]></description><category></category></item><item><title><![CDATA[【含例题】树中边、度、点的关系]]></title><link>https://blog.youkuaiyun.com/ThreeDoves/article/details/139301710</link><guid>https://blog.youkuaiyun.com/ThreeDoves/article/details/139301710</guid><author>ThreeDoves</author><pubDate>Wed, 29 May 2024 18:08:59 +0800</pubDate><description><![CDATA[一棵二叉树，度为2结点数为70，度为1结点数为176，则叶子结点数为( ).A.71B.69C.175D.177在做这道题之前，要先理解一棵树中的关系。对一棵n度树，设0度点（叶子节点）数量为N0​，1度点数量为N1​……n度点为Nn​，列三个方程，即可求解节点数、度数、边数中的未知量。]]></description><category></category></item><item><title><![CDATA[洛谷P1217题解（全AC）]]></title><link>https://blog.youkuaiyun.com/ThreeDoves/article/details/133778539</link><guid>https://blog.youkuaiyun.com/ThreeDoves/article/details/133778539</guid><author>ThreeDoves</author><pubDate>Fri, 13 Oct 2023 07:07:06 +0800</pubDate><description><![CDATA[因为 151 既是一个质数又是一个回文数（从左到右和从右到左是看一样的），所以 151 是回文质数。写一个程序来找出范围 [a,b](5≤a<b≤100,000,000)（一亿）间的所有回文质数。]]></description><category></category></item><item><title><![CDATA[洛谷P1009题解（全AC）]]></title><link>https://blog.youkuaiyun.com/ThreeDoves/article/details/133693076</link><guid>https://blog.youkuaiyun.com/ThreeDoves/article/details/133693076</guid><author>ThreeDoves</author><pubDate>Mon, 09 Oct 2023 07:45:15 +0800</pubDate><description><![CDATA[表示阶乘，定义为 n!而int的取值范围为： -2^31——2^31-1，即-2147483648——2147483647，约2*10E9。前面我们讲了高精度是把每位的数字分别存到数组中，因此高精度的读取和加减乘除方式也会和常规有所不同。最容易想到的是，创建数组jc[n]，jc[0] = 1!举个例子，如果存入三位数，那么百位的数字会存储在a[2]，而个位在a[0]。]]></description><category></category></item><item><title><![CDATA[洛谷P1055题解（全AC）]]></title><link>https://blog.youkuaiyun.com/ThreeDoves/article/details/133678837</link><guid>https://blog.youkuaiyun.com/ThreeDoves/article/details/133678837</guid><author>ThreeDoves</author><pubDate>Sun, 08 Oct 2023 15:01:26 +0800</pubDate><description><![CDATA[第一次写题解，请来访的各位大佬多多包涵 awa（完整程序见文末，已验证全AC）]]></description><category></category></item></channel></rss>