<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:media="http://search.yahoo.com/mrss/"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>VC6 &#8211; Natuki Lab.</title>
	<atom:link href="https://tree.moe/tag/vc6/feed/" rel="self" type="application/rss+xml" />
	<link>https://tree.moe</link>
	<description>云端筑梦</description>
	<lastBuildDate>Wed, 24 Nov 2021 15:13:33 +0000</lastBuildDate>
	<language>zh-Hans</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.0</generator>
	<item>
		<title>夏树的C语言篇 &#8211; 获取Bmp位图的宽高</title>
		<link>https://tree.moe/vc6-get-bmp-size/</link>
					<comments>https://tree.moe/vc6-get-bmp-size/#respond</comments>
		
		<dc:creator><![CDATA[Natuki]]></dc:creator>
		<pubDate>Fri, 31 Jan 2020 11:16:47 +0000</pubDate>
				<category><![CDATA[笔记存档]]></category>
		<category><![CDATA[Bmp位图]]></category>
		<category><![CDATA[GDI]]></category>
		<category><![CDATA[VC6]]></category>
		<guid isPermaLink="false">https://tree.moe/?p=59</guid>

					<description><![CDATA[0.写在前面 最近才开始研究C语言控制台贴图的内容(同学格斗游戏都快做完啦?!), 之前做课设的时候一直感觉模 &#8230; <a href="https://tree.moe/vc6-get-bmp-size/" class="more-link">继续阅读<span class="screen-reader-text">夏树的C语言篇 &#8211; 获取Bmp位图的宽高</span></a>]]></description>
		
					<wfw:commentRss>https://tree.moe/vc6-get-bmp-size/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>夏树的C语言篇 &#8211; 简易Kmeans类聚算法实现对点集的分组</title>
		<link>https://tree.moe/vc-kmeans-best-grouping/</link>
					<comments>https://tree.moe/vc-kmeans-best-grouping/#comments</comments>
		
		<dc:creator><![CDATA[Natuki]]></dc:creator>
		<pubDate>Sat, 11 Jan 2020 13:59:08 +0000</pubDate>
				<category><![CDATA[摸鱼日常]]></category>
		<category><![CDATA[GDI]]></category>
		<category><![CDATA[Kmeans]]></category>
		<category><![CDATA[VC6]]></category>
		<category><![CDATA[算法]]></category>
		<guid isPermaLink="false">https://tree.moe/?p=23</guid>

					<description><![CDATA[0.写在前面 夏树大一上学期为时一周的C语言课设就在昨天周五结束了。其中印象比较深刻的就是课设中有一题运用Km &#8230; <a href="https://tree.moe/vc-kmeans-best-grouping/" class="more-link">继续阅读<span class="screen-reader-text">夏树的C语言篇 &#8211; 简易Kmeans类聚算法实现对点集的分组</span></a>]]></description>
		
					<wfw:commentRss>https://tree.moe/vc-kmeans-best-grouping/feed/</wfw:commentRss>
			<slash:comments>1</slash:comments>
		
		
			</item>
	</channel>
</rss>
