<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[YoungHacker_dyz的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/YoungHacker_dyz</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; YoungHacker_dyz]]></copyright><item><title><![CDATA[C++全排列]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/132503376</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/132503376</guid><author>YoungHacker_dyz</author><pubDate>Sun, 10 Sep 2023 15:03:28 +0800</pubDate><description><![CDATA[知周所众，大家在做题的过程中，经常会遇到一些有关于数组全排列的问题，例如……好像没什么例如，总之就是十分有用。小编今天就和大家介绍一个非常神奇的函数——全排列函数。首先，他本体长这样：next_permutation（a+r,a+l）;其作用就是把数组a中区间 [ r , l ) 里的所有数据进行 “ 下一个全排列 ” 操作。他还有个异父异母的亲兄弟：prev_permutation（a+r,a+l）;他的作用是进行 “ 上一个全排列 ” 操作。]]></description><category></category></item><item><title><![CDATA[二叉树的序列转换（先序，中序，后序，按层）C++]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/131877067</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/131877067</guid><author>YoungHacker_dyz</author><pubDate>Tue, 08 Aug 2023 16:55:57 +0800</pubDate><description><![CDATA[那么，不可避免的，就要学习二叉数的四种存储序列：先序遍历，中序遍历，后序遍历，按层遍历。即先存储树根，若此根有左子树，则递归存储左子树，若此根有右子树，则递归存储右子树。中序的存储方式为左（left）—— 根（root）——右（right）。即若此根有左子树，则递归存储左子树，再存储树根，若此根有右子树，则递归存储右子树。中序的存储方式为左（left）——右（right）——根（root）。即若此根有左子树，则递归存储左子树，再存储树根，若此根有右子树，则递归存储右子树。非常煎蛋，只要广搜一下就可以了。]]></description><category></category></item><item><title><![CDATA[1173：阶乘和]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/129650330</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/129650330</guid><author>YoungHacker_dyz</author><pubDate>Sun, 19 Mar 2023 14:13:36 +0800</pubDate><description><![CDATA[用高精度计算出S=1!（n≤100）�=1!（�≤100）,其中“!”表示阶乘，例如：5!=5×4×3×2×1。输入正整数n�，输出计算结果S�。]]></description><category></category></item><item><title><![CDATA[1168：大整数加法]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/129650297</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/129650297</guid><author>YoungHacker_dyz</author><pubDate>Sun, 19 Mar 2023 14:12:17 +0800</pubDate><description><![CDATA[一行，即相加后的结果。结果里不能有多余的前导0，即如果结果是342，那么就不能输出为0342。有两行，每行是一个不超过200位的非负整数，可能有多余的前导0。求两个不超过200位的非负整数的和。]]></description><category></category></item><item><title><![CDATA[1172：求10000以内n的阶乘]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/129650313</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/129650313</guid><author>YoungHacker_dyz</author><pubDate>Sun, 19 Mar 2023 14:12:04 +0800</pubDate><description><![CDATA[只有一行输入，整数n（0≤n≤100000≤。求1000010000以内n�的阶乘。]]></description><category></category></item><item><title><![CDATA[1308：【例1.5】高精除]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/129650270</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/129650270</guid><author>YoungHacker_dyz</author><pubDate>Sun, 19 Mar 2023 14:10:56 +0800</pubDate><description><![CDATA[高精除以高精，求它们的商和余数。输入两个低于300位的正整数。]]></description><category></category></item><item><title><![CDATA[2040：【例5.7】筛选法找质数]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893261</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893261</guid><author>YoungHacker_dyz</author><pubDate>Wed, 16 Nov 2022 21:01:29 +0800</pubDate><description><![CDATA[【代码】2040：【例5.7】筛选法找质数。]]></description><category></category></item><item><title><![CDATA[2039：【例5.6】冒泡排序]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893243</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893243</guid><author>YoungHacker_dyz</author><pubDate>Wed, 16 Nov 2022 21:00:44 +0800</pubDate><description><![CDATA[【代码】2039：【例5.6】冒泡排序。]]></description><category></category></item><item><title><![CDATA[2038：【例5.5】最大数位置]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893228</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893228</guid><author>YoungHacker_dyz</author><pubDate>Wed, 16 Nov 2022 20:59:56 +0800</pubDate><description><![CDATA[【代码】2038：【例5.5】最大数位置。]]></description><category></category></item><item><title><![CDATA[2038：【例5.5】最大数位置]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893188</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893188</guid><author>YoungHacker_dyz</author><pubDate>Wed, 16 Nov 2022 20:58:11 +0800</pubDate><description><![CDATA[【代码】2038：【例5.5】最大数位置。]]></description><category></category></item><item><title><![CDATA[2037：【例5.4】约瑟夫问题]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893157</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893157</guid><author>YoungHacker_dyz</author><pubDate>Wed, 16 Nov 2022 20:56:36 +0800</pubDate><description><![CDATA[【代码】2037：【例5.4】约瑟夫问题。]]></description><category></category></item><item><title><![CDATA[2036：【例5.3】开关门]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893144</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893144</guid><author>YoungHacker_dyz</author><pubDate>Wed, 16 Nov 2022 20:56:07 +0800</pubDate><description><![CDATA[【代码】2036：【例5.3】开关门。]]></description><category></category></item><item><title><![CDATA[2035：【例5.2】平移数据]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893112</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893112</guid><author>YoungHacker_dyz</author><pubDate>Wed, 16 Nov 2022 20:54:10 +0800</pubDate><description><![CDATA[【代码】2035：【例5.2】平移数据。]]></description><category></category></item><item><title><![CDATA[2034：【例5.1】反序输出]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893078</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127893078</guid><author>YoungHacker_dyz</author><pubDate>Wed, 16 Nov 2022 20:52:56 +0800</pubDate><description><![CDATA[【代码】2034：【例5.1】反序输出。]]></description><category></category></item><item><title><![CDATA[DEVC++小游戏pvp]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127476760</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/127476760</guid><author>YoungHacker_dyz</author><pubDate>Sun, 23 Oct 2022 16:38:56 +0800</pubDate><description><![CDATA[【代码】DEVC++小游戏pvp。]]></description><category></category></item><item><title><![CDATA[算法专讲——搜索与回溯（宽度优先搜索算法）]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/126431324</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/126431324</guid><author>YoungHacker_dyz</author><pubDate>Fri, 19 Aug 2022 20:40:37 +0800</pubDate><description><![CDATA[本章涉及递归思想，不会递归的人请先浏览递归算法搜索与回溯是计算机解题中常用的算法，很多问题无法根据某种确定的计算法则来求解，可以利用搜索与回溯的技术求解。回溯是搜索算法中的一种控制策略。它的基本思想是：为了求得问题的解，先选择某一种可能的情况向前探索，在探索过程中，一旦发现原来的选择是错误的，就退回一步重新选择，继续向前探索，如此反复进行，直至得到解或证明无解。]]></description><category></category></item><item><title><![CDATA[算法专讲——递归]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/126430662</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/126430662</guid><author>YoungHacker_dyz</author><pubDate>Fri, 19 Aug 2022 19:55:35 +0800</pubDate><description><![CDATA[当函数定义中，其内部操作又直接或间接地出现对自身的调用，则称这样的程序嵌套定义为递归定义。递归通常把一个大型复杂的问题层层转化为一个与原问题想似的规模较小的问题来求解，递归策略只需少量的程序就可描述出解题过程所需的多层重复计算，大大的减少了程序的代码量。递归的能力再于用有限的语句来定义对象的无限集合。用递归思想写出的程序往往十分简洁易懂。当函数直接调用其自身，我们称为直接递归；当函数间接调用其自身，我们称为间接递归。递归算法无固定框架，如何写程序取决题目。求1+2+3+...N【题目描述】]]></description><category></category></item><item><title><![CDATA[DEVc++小游戏集合（共9个）]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/126374964</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/126374964</guid><author>YoungHacker_dyz</author><pubDate>Tue, 16 Aug 2022 21:48:59 +0800</pubDate><description><![CDATA[代码】DEVc++小游戏集合（共9个）]]></description><category></category></item><item><title><![CDATA[算法专讲——递推]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/126373934</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/126373934</guid><author>YoungHacker_dyz</author><pubDate>Tue, 16 Aug 2022 21:26:40 +0800</pubDate><description><![CDATA[递推算法：一个问题求解需要一系列的计算，在已知条件和所求解问题之间总存在着某种相互联系的关系，在计算时，如果可以找到前后过程之间的数量关系（即递推试），那么，从问题出发逐步推到已知条件，这种方法叫逆推。无论顺推还是逆推，其关键是要找到递推试。这种处理问题的方法能使复杂算法化为若干步重复的简单运算，充分发挥计算机擅长于重复处理的特点。菲波那契数列。......]]></description><category></category></item><item><title><![CDATA[进制转换（十进制转n进制C++）]]></title><link>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/126336589</link><guid>https://blog.youkuaiyun.com/YoungHacker_dyz/article/details/126336589</guid><author>YoungHacker_dyz</author><pubDate>Sun, 14 Aug 2022 21:46:34 +0800</pubDate><description><![CDATA[在题目中，经常会有要求你把进制转换后进行处理。这时，你可以试试递归求余的方法。首先，由于可能会出现十六进制，所以先定义一个字符数组。由栈空间保存递归数据最适合用来。对n求余，倒序输出。......]]></description><category></category></item></channel></rss>