<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[NOIP1ding_c的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/NOIP1ding_c</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; NOIP1ding_c]]></copyright><item><title><![CDATA[做个闹钟吧]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145468318</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145468318</guid><author>NOIP1ding_c</author><pubDate>Thu, 06 Feb 2025 10:35:55 +0800</pubDate><description><![CDATA[【代码】做个闹钟吧。]]></description><category></category></item><item><title><![CDATA[水仙花数答案]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145167874</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145167874</guid><author>NOIP1ding_c</author><pubDate>Wed, 15 Jan 2025 20:52:15 +0800</pubDate><description><![CDATA[水仙花数c++实现。]]></description><category></category></item><item><title><![CDATA[string:从入门到精通]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145159883</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145159883</guid><author>NOIP1ding_c</author><pubDate>Wed, 15 Jan 2025 20:42:28 +0800</pubDate><description><![CDATA[string是C++标准库中用于处理字符串的重要类，它提供了丰富的操作函数和灵活的内存管理机制，使得字符串操作更加安全和高效‌‌。]]></description><category></category></item><item><title><![CDATA[水仙花数c++实现]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145155703</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145155703</guid><author>NOIP1ding_c</author><pubDate>Wed, 15 Jan 2025 11:55:29 +0800</pubDate><description><![CDATA[水仙花数（Narcissistic number）也被称为、阿姆斯壮数或（Armstrong number），水仙花数是指一个 3 位数，它的每个数位上的数字的 3次幂之和等于它本身。例如：1^3 + 5^3+ 3^3 = 153。——来自百度百科。]]></description><category></category></item><item><title><![CDATA[抢十八游戏]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145146583</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145146583</guid><author>NOIP1ding_c</author><pubDate>Tue, 14 Jan 2025 20:10:35 +0800</pubDate><description><![CDATA[我国民国一直流传着一个名叫“抢十八”的抢数游戏：参与游戏的两人从1开始轮流报数，每次至少报1个数，最多报2个数，每人报的每个数不得与自已报过的或对方报过的重复，也不得跳过任何一个数。谁先报到18，谁就获胜。]]></description><category></category></item><item><title><![CDATA[Stein算法]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145139813</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145139813</guid><author>NOIP1ding_c</author><pubDate>Tue, 14 Jan 2025 16:51:21 +0800</pubDate><description><![CDATA[Stein算法‌‌是一种计算两个数最大公约数的算法，旨在改进在处理大整数时效率低下的问题。该算法通过减法和位移操作替代除法，提高了计算速度，尤其适用于硬件实现。‌。]]></description><category></category></item><item><title><![CDATA[以碗知僧——《算法统宗》著名题目]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145050784</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145050784</guid><author>NOIP1ding_c</author><pubDate>Fri, 10 Jan 2025 10:28:32 +0800</pubDate><description><![CDATA[以碗知僧出自于我国明代著名数学家程大位所著的《算法统宗》，感兴趣的可以了解一下。程大位《算法统宗》]]></description><category></category></item><item><title><![CDATA[百僧分馍——《算法统宗》著名题目]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145016033</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/145016033</guid><author>NOIP1ding_c</author><pubDate>Wed, 08 Jan 2025 19:53:10 +0800</pubDate><description><![CDATA[百僧分馍出自于我国明代著名数学家程大位所著的《算法统宗》，感兴趣的可以了解一下。程大位《算法统宗》]]></description><category></category></item><item><title><![CDATA[#include ＜algorithm＞应用]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144972047</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144972047</guid><author>NOIP1ding_c</author><pubDate>Mon, 06 Jan 2025 20:50:18 +0800</pubDate><description><![CDATA[在看这篇文章之前，先看看#include 的简介。这篇文章我来给大家几个algorithm的应用。]]></description><category></category></item><item><title><![CDATA[#include ＜map＞应用]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144971874</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144971874</guid><author>NOIP1ding_c</author><pubDate>Mon, 06 Jan 2025 20:42:20 +0800</pubDate><description><![CDATA[在看这篇文章之前，先看看#include <map>的简介。这篇文章我来给大家一个map的应用。]]></description><category></category></item><item><title><![CDATA[十大排序算法之归并排序]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144911248</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144911248</guid><author>NOIP1ding_c</author><pubDate>Fri, 03 Jan 2025 16:14:58 +0800</pubDate><description><![CDATA[排序是重要又较为简单的算法之一，个人认为学习算法建议先学习排序，排序有十种重要的排序方法，有些好，有些坏。‌归并排序是一种高效的排序算法，基于分治策略，通过递归分解和合并操作实现排序。其核心思想是将一个数组分成若干个子数组，分别对每个子数组进行排序，然后将已排序的子数组合并成一个完整的排序数组。]]></description><category></category></item><item><title><![CDATA[#include ＜ctime＞应用]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144894666</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144894666</guid><author>NOIP1ding_c</author><pubDate>Thu, 02 Jan 2025 20:55:25 +0800</pubDate><description><![CDATA[在看这篇文章之前，先看看#include <ctime>的简介。ctime这篇文章我来给大家一个ctime的应用。]]></description><category></category></item><item><title><![CDATA[十大排序算法之插入排序]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144871452</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144871452</guid><author>NOIP1ding_c</author><pubDate>Wed, 01 Jan 2025 20:46:12 +0800</pubDate><description><![CDATA[插入排序‌是一种简单直观的排序算法，它的工作原理是通过构建有序序列，对于未排序数据，在已排序序列中从后向前扫描，找到相应位置并插入。插入排序在实现上，通常采用in-place排序（即只需用到O(1)的额外空间的排序）。]]></description><category></category></item><item><title><![CDATA[#include ＜fstream＞应用]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144871278</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144871278</guid><author>NOIP1ding_c</author><pubDate>Wed, 01 Jan 2025 19:58:04 +0800</pubDate><description><![CDATA[在看这篇文章之前，先看看#include <fstream>的简介。fstream这篇文章我来给大家几个fstream的应用。]]></description><category></category></item><item><title><![CDATA[十大排序算法之希尔排序]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144857137</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144857137</guid><author>NOIP1ding_c</author><pubDate>Tue, 31 Dec 2024 21:05:47 +0800</pubDate><description><![CDATA[‌希尔排序（Shell Sort）‌是一种基于插入排序的算法，由于1959年提出。它通过将待排序的元素分成多个子序列，对每个子序列进行插入排序，然后逐渐减小子序列的间隔，最终达到整个序列的有序排列。希尔排序的核心思想是利用插入排序在已排序序列上高效工作的特性，通过减少数据移动来提高排序效率‌12。]]></description><category></category></item><item><title><![CDATA[十大排序算法之冒泡排序]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144856394</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144856394</guid><author>NOIP1ding_c</author><pubDate>Tue, 31 Dec 2024 20:11:45 +0800</pubDate><description><![CDATA[‌冒泡排序（Bubble Sort）‌是一种简单的排序算法，其基本思想是通过重复遍历待排序的数列，比较相邻元素并在必要时交换它们的位置，直到数列完全有序。冒泡排序的时间复杂度为O(n^2)，适用于数据量较小的情况。]]></description><category></category></item><item><title><![CDATA[十大排序算法之选择排序]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144855344</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144855344</guid><author>NOIP1ding_c</author><pubDate>Tue, 31 Dec 2024 19:22:50 +0800</pubDate><description><![CDATA[‌选择排序（Selection Sort）‌是一种简单直观的排序算法，其基本思想是通过多次遍历数组，每次找出剩余未排序部分的最小（或最大）元素，将其放到已排序序列的起始位置，直到整个序列排序完成。]]></description><category></category></item><item><title><![CDATA[#include ＜iostream＞应用]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144854011</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144854011</guid><author>NOIP1ding_c</author><pubDate>Tue, 31 Dec 2024 17:10:17 +0800</pubDate><description><![CDATA[在看这篇文章之前，先看看#include 的简介。这篇文章我来给大家几个iostrem的应用。]]></description><category></category></item><item><title><![CDATA[#include ＜list＞应用]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144751850</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144751850</guid><author>NOIP1ding_c</author><pubDate>Thu, 26 Dec 2024 20:02:03 +0800</pubDate><description><![CDATA[在看这篇文章之前，先看看#include <list>的简介。这篇文章我来给大家几个list的应用。]]></description><category></category></item><item><title><![CDATA[#include ＜vector＞应用]]></title><link>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144727373</link><guid>https://blog.youkuaiyun.com/NOIP1ding_c/article/details/144727373</guid><author>NOIP1ding_c</author><pubDate>Wed, 25 Dec 2024 20:21:50 +0800</pubDate><description><![CDATA[在看这篇文章之前，先看看#include <vector>的简介。这篇文章我来给大家几个vector的应用。]]></description><category></category></item></channel></rss>