<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[山中一扶苏的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a13275906705</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a13275906705]]></copyright><item><title><![CDATA[c++中unrodered_map与unordered_set的基本使用]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/138452169</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/138452169</guid><author>a13275906705</author><pubDate>Sat, 04 May 2024 22:37:35 +0800</pubDate><description><![CDATA[c++中unrodered_map与unordered_set的基本使用]]></description><category></category></item><item><title><![CDATA[c++中map与set的基本使用]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/138451399</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/138451399</guid><author>a13275906705</author><pubDate>Sat, 04 May 2024 22:20:56 +0800</pubDate><description><![CDATA[可以了解一下c++中map与set容器的基本使用。]]></description><category></category></item><item><title><![CDATA[掷骰子(从暴力搜索 到 记忆化搜索 到 动态规划)]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/136445405</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/136445405</guid><author>a13275906705</author><pubDate>Wed, 06 Mar 2024 15:11:56 +0800</pubDate><description><![CDATA[本篇文章记录了动态规划问题的思考方式，有益于日后思考动态规划问题，主要是分三个步骤：1.暴力搜索(递归)，2.记忆化搜索(递归)，3.动态规划(递推)]]></description><category></category></item><item><title><![CDATA[SpringAOP]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/136378246</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/136378246</guid><author>a13275906705</author><pubDate>Thu, 29 Feb 2024 18:55:49 +0800</pubDate><description><![CDATA[简要介绍SpringAop的概念及其注解用法]]></description><category></category></item><item><title><![CDATA[三种二叉树序列两两组合构造二叉树]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/136268076</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/136268076</guid><author>a13275906705</author><pubDate>Sat, 24 Feb 2024 10:00:54 +0800</pubDate><description><![CDATA[统一算法：递归 + map映射 
构造二叉树]]></description><category></category></item><item><title><![CDATA[由斐波那契数列探究递推与递归]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/136136965</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/136136965</guid><author>a13275906705</author><pubDate>Sat, 17 Feb 2024 12:44:27 +0800</pubDate><description><![CDATA[递推 / 递归]]></description><category></category></item><item><title><![CDATA[网络安全习题集]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/131766953</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/131766953</guid><author>a13275906705</author><pubDate>Sat, 17 Feb 2024 10:52:38 +0800</pubDate><description><![CDATA[数字签名以密码技术为基础，其安全性取决于签名所使用的密码系统的安全程度。6  A 向 B 发送消息 M , A 利用加密技术（E为对称加密函数， D 为公开加密函数， K为对称密钥， SK A 为 A 的秘密密钥， SK B 为 B 的秘密密钥）、散列函数（H） 同时实现报文的认证、数字签名和保密性的方法是（C )。节串），公开密码函数为 E ，散列函数为 H , A 的公钥为 PUa私钥为 PRa, B 的公钥为 PUb ，私钥为 PRb ，提供机密性、不可否认性、完整性保护的最佳方案是（A )。]]></description><category></category></item><item><title><![CDATA[软件工程选择与判断题]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/128372035</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/128372035</guid><author>a13275906705</author><pubDate>Mon, 19 Dec 2022 19:18:51 +0800</pubDate><description><![CDATA[一些软件工程的简单选择题与判断题记录]]></description><category></category></item><item><title><![CDATA[定时红绿灯(C51单片机)]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/128355516</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/128355516</guid><author>a13275906705</author><pubDate>Sun, 18 Dec 2022 16:27:38 +0800</pubDate><description><![CDATA[利用中断处理制作的定时LED红绿灯系统（C51单片机）]]></description><category></category></item><item><title><![CDATA[软件需求说明书(GB856T-88)]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/126594136</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/126594136</guid><author>a13275906705</author><pubDate>Thu, 29 Sep 2022 21:30:16 +0800</pubDate><description><![CDATA[软件需求说明书(GB856T-88)]]></description><category></category></item><item><title><![CDATA[并查集应用：Blackout 2]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/126482805</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/126482805</guid><author>a13275906705</author><pubDate>Tue, 23 Aug 2022 16:51:36 +0800</pubDate><description><![CDATA[并查集 + 逆向操作 + 超级源点]]></description><category></category></item><item><title><![CDATA[贪心+差分的题目：gaming]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/126359213</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/126359213</guid><author>a13275906705</author><pubDate>Tue, 16 Aug 2022 09:42:35 +0800</pubDate><description><![CDATA[贪心 + 差分]]></description><category></category></item><item><title><![CDATA[最小步数模型-word]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/126358109</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/126358109</guid><author>a13275906705</author><pubDate>Tue, 16 Aug 2022 08:24:07 +0800</pubDate><description><![CDATA[bfs最小步数模型 + bfs路径回溯]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 263 部分题解]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/126254511</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/126254511</guid><author>a13275906705</author><pubDate>Tue, 09 Aug 2022 20:45:01 +0800</pubDate><description><![CDATA[A.模拟
B.dfs
C.dfs
D.动态规划(线性dp)
E.快速幂求逆元 + 动态规划(期望dp) + 前缀和]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 262 部分题解]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/126147622</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/126147622</guid><author>a13275906705</author><pubDate>Thu, 04 Aug 2022 09:56:41 +0800</pubDate><description><![CDATA[A.模拟
B.模拟
C.组合数 + 数组映射
D.动态规划 + 取模状态转移
E.逆元求组合数]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 261 部分题解]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/126037808</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/126037808</guid><author>a13275906705</author><pubDate>Thu, 28 Jul 2022 16:40:30 +0800</pubDate><description><![CDATA[A.差分
B.模拟
C.map统计
D.动态规划的背包问题
E.位运算]]></description><category></category></item><item><title><![CDATA[Draw Your Cards]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/126012709</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/126012709</guid><author>a13275906705</author><pubDate>Wed, 27 Jul 2022 13:33:59 +0800</pubDate><description><![CDATA[链式存储 + 二分查找]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 259 部分题解]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/125761396</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/125761396</guid><author>a13275906705</author><pubDate>Wed, 13 Jul 2022 16:33:04 +0800</pubDate><description><![CDATA[A. 模拟
B. 计算
C. 字符串
D. 计算几何(圆) + 最短路
E. LCM + 排序]]></description><category></category></item><item><title><![CDATA[数独 (dfs)]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/125746856</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/125746856</guid><author>a13275906705</author><pubDate>Tue, 12 Jul 2022 16:59:54 +0800</pubDate><description><![CDATA[dfs(深度优先搜索)]]></description><category></category></item><item><title><![CDATA[Infected Tree(树形dp)]]></title><link>https://blog.youkuaiyun.com/a13275906705/article/details/125605752</link><guid>https://blog.youkuaiyun.com/a13275906705/article/details/125605752</guid><author>a13275906705</author><pubDate>Mon, 04 Jul 2022 19:12:49 +0800</pubDate><description><![CDATA[树形dp例题]]></description><category></category></item></channel></rss>