<?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>猴子选大王 - 四号程序员</title>
	<atom:link href="https://www.coder4.com/archives/tag/%E7%8C%B4%E5%AD%90%E9%80%89%E5%A4%A7%E7%8E%8B/feed" rel="self" type="application/rss+xml" />
	<link>https://www.coder4.com</link>
	<description>Keep It Simple and Stupid</description>
	<lastBuildDate>Thu, 26 Nov 2009 08:35:44 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.8.3</generator>
	<item>
		<title>猴子选大王（约瑟夫环问题）c语言描述</title>
		<link>https://www.coder4.com/archives/89</link>
					<comments>https://www.coder4.com/archives/89#comments</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Thu, 26 Nov 2009 08:35:44 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[猴子选大王]]></category>
		<category><![CDATA[约瑟夫环]]></category>
		<category><![CDATA[链表实现]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=89</guid>

					<description><![CDATA[猴子选大王（约瑟夫环问题），用链表实现的 #include #include #define n 20 #define m 5 typedef struct monkey { int num; struct monkey *next; } Monkey,*LINK; int main() { LINK p,head,p2; int i; head=p=p2=(LINK)malloc(sizeof(Monkey)); for(i=1;i { p=[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/89/feed</wfw:commentRss>
			<slash:comments>3</slash:comments>
		
		
			</item>
	</channel>
</rss>
