﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>博客园-ZXSOFT's Blog - 张旋.NET -随笔分类-C、算法、数据结构</title><link>http://www.cnblogs.com/zxsoft/category/100071.html</link><description>All things are difficult before they are easy.
以学习技术为方法，以提高职业素质为目的。 http://www.zhangxuan.net
</description><language>zh-cn</language><lastBuildDate>Sun, 18 May 2008 21:30:45 GMT</lastBuildDate><pubDate>Sun, 18 May 2008 21:30:45 GMT</pubDate><ttl>60</ttl><item><title>上L层楼梯有几种上法？</title><link>http://www.cnblogs.com/zxsoft/archive/2008/01/07/1029382.html</link><dc:creator>张旋</dc:creator><author>张旋</author><pubDate>Mon, 07 Jan 2008 11:20:00 GMT</pubDate><guid>http://www.cnblogs.com/zxsoft/archive/2008/01/07/1029382.html</guid><wfw:comment>http://www.cnblogs.com/zxsoft/comments/1029382.html</wfw:comment><comments>http://www.cnblogs.com/zxsoft/archive/2008/01/07/1029382.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/zxsoft/comments/commentRss/1029382.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/zxsoft/services/trackbacks/1029382.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 某楼梯有L层台阶，上楼梯可以一次迈一层，也可以一次迈两层。那么走完这L层台阶共有几种走法？用递归的思路分析：1.如果只有一层楼梯，那么自然只有一种走法。2.如果有两层楼梯，那么有两...&nbsp;&nbsp;<a href='http://www.cnblogs.com/zxsoft/archive/2008/01/07/1029382.html'>阅读全文</a><img src ="http://www.cnblogs.com/zxsoft/aggbug/1029382.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://zxsoft.cnblogs.com/" target="_blank">张旋</a> 2008-01-07 19:20 <a href="http://www.cnblogs.com/zxsoft/archive/2008/01/07/1029382.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>考ACM需要的知识(转)</title><link>http://www.cnblogs.com/zxsoft/archive/2007/10/29/940877.html</link><dc:creator>张旋</dc:creator><author>张旋</author><pubDate>Sun, 28 Oct 2007 20:40:00 GMT</pubDate><guid>http://www.cnblogs.com/zxsoft/archive/2007/10/29/940877.html</guid><wfw:comment>http://www.cnblogs.com/zxsoft/comments/940877.html</wfw:comment><comments>http://www.cnblogs.com/zxsoft/archive/2007/10/29/940877.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/zxsoft/comments/commentRss/940877.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/zxsoft/services/trackbacks/940877.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: (转自：http://www.ithao123.com/topic/10002.html)对ACM竞赛的算法大概分了一下类，分成了数学、数据结构和算法三大块。　　对ACM竞赛的算法大概...&nbsp;&nbsp;<a href='http://www.cnblogs.com/zxsoft/archive/2007/10/29/940877.html'>阅读全文</a><img src ="http://www.cnblogs.com/zxsoft/aggbug/940877.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://zxsoft.cnblogs.com/" target="_blank">张旋</a> 2007-10-29 04:40 <a href="http://www.cnblogs.com/zxsoft/archive/2007/10/29/940877.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>辗转相除</title><link>http://www.cnblogs.com/zxsoft/archive/2007/10/28/940155.html</link><dc:creator>张旋</dc:creator><author>张旋</author><pubDate>Sat, 27 Oct 2007 23:10:00 GMT</pubDate><guid>http://www.cnblogs.com/zxsoft/archive/2007/10/28/940155.html</guid><wfw:comment>http://www.cnblogs.com/zxsoft/comments/940155.html</wfw:comment><comments>http://www.cnblogs.com/zxsoft/archive/2007/10/28/940155.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/zxsoft/comments/commentRss/940155.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/zxsoft/services/trackbacks/940155.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 节选自：（http://zhidao.baidu.com/question/5920943.html）若&nbsp;a=bq+r,则a和b的最大公因子等于b和r的最大公因子绝对值（都为整数）&...&nbsp;&nbsp;<a href='http://www.cnblogs.com/zxsoft/archive/2007/10/28/940155.html'>阅读全文</a><img src ="http://www.cnblogs.com/zxsoft/aggbug/940155.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://zxsoft.cnblogs.com/" target="_blank">张旋</a> 2007-10-28 07:10 <a href="http://www.cnblogs.com/zxsoft/archive/2007/10/28/940155.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>(C#)ACM考试题的第二题</title><link>http://www.cnblogs.com/zxsoft/archive/2007/10/26/938082.html</link><dc:creator>张旋</dc:creator><author>张旋</author><pubDate>Thu, 25 Oct 2007 20:58:00 GMT</pubDate><guid>http://www.cnblogs.com/zxsoft/archive/2007/10/26/938082.html</guid><wfw:comment>http://www.cnblogs.com/zxsoft/comments/938082.html</wfw:comment><comments>http://www.cnblogs.com/zxsoft/archive/2007/10/26/938082.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/zxsoft/comments/commentRss/938082.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/zxsoft/services/trackbacks/938082.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 这个有点难啊。暂时这么做了做，不符合第二条要求。BBC的话。会有重复的。BBCBCBBCBCBB虽然筛选不重复的肯定可以实现，不过这肯定不是题目原意。有时间需要重新做一下u...&nbsp;&nbsp;<a href='http://www.cnblogs.com/zxsoft/archive/2007/10/26/938082.html'>阅读全文</a><img src ="http://www.cnblogs.com/zxsoft/aggbug/938082.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://zxsoft.cnblogs.com/" target="_blank">张旋</a> 2007-10-26 04:58 <a href="http://www.cnblogs.com/zxsoft/archive/2007/10/26/938082.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>(C#)ACM考试题的第一题</title><link>http://www.cnblogs.com/zxsoft/archive/2007/10/26/938080.html</link><dc:creator>张旋</dc:creator><author>张旋</author><pubDate>Thu, 25 Oct 2007 20:11:00 GMT</pubDate><guid>http://www.cnblogs.com/zxsoft/archive/2007/10/26/938080.html</guid><wfw:comment>http://www.cnblogs.com/zxsoft/comments/938080.html</wfw:comment><comments>http://www.cnblogs.com/zxsoft/archive/2007/10/26/938080.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/zxsoft/comments/commentRss/938080.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/zxsoft/services/trackbacks/938080.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 哈哈！竟用C#写了。偷懒呀！以后还要用C语言再写一次。用C#写这个太简单了。using&nbsp;System;using&nbsp;System.Collections.Generi...&nbsp;&nbsp;<a href='http://www.cnblogs.com/zxsoft/archive/2007/10/26/938080.html'>阅读全文</a><img src ="http://www.cnblogs.com/zxsoft/aggbug/938080.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://zxsoft.cnblogs.com/" target="_blank">张旋</a> 2007-10-26 04:11 <a href="http://www.cnblogs.com/zxsoft/archive/2007/10/26/938080.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>ACM考试的题目，收藏，有空做做</title><link>http://www.cnblogs.com/zxsoft/archive/2007/10/26/938077.html</link><dc:creator>张旋</dc:creator><author>张旋</author><pubDate>Thu, 25 Oct 2007 20:04:00 GMT</pubDate><guid>http://www.cnblogs.com/zxsoft/archive/2007/10/26/938077.html</guid><wfw:comment>http://www.cnblogs.com/zxsoft/comments/938077.html</wfw:comment><comments>http://www.cnblogs.com/zxsoft/archive/2007/10/26/938077.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/zxsoft/comments/commentRss/938077.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/zxsoft/services/trackbacks/938077.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 第一题ItisreallyamazingthatthegreathistorianDr.Khasrecentlyfoundthatabout10Millionyea...&nbsp;&nbsp;<a href='http://www.cnblogs.com/zxsoft/archive/2007/10/26/938077.html'>阅读全文</a><img src ="http://www.cnblogs.com/zxsoft/aggbug/938077.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://zxsoft.cnblogs.com/" target="_blank">张旋</a> 2007-10-26 04:04 <a href="http://www.cnblogs.com/zxsoft/archive/2007/10/26/938077.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Astar2007初赛第一场的题目</title><link>http://www.cnblogs.com/zxsoft/archive/2007/07/30/835857.html</link><dc:creator>张旋</dc:creator><author>张旋</author><pubDate>Sun, 29 Jul 2007 18:55:00 GMT</pubDate><guid>http://www.cnblogs.com/zxsoft/archive/2007/07/30/835857.html</guid><wfw:comment>http://www.cnblogs.com/zxsoft/comments/835857.html</wfw:comment><comments>http://www.cnblogs.com/zxsoft/archive/2007/07/30/835857.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/zxsoft/comments/commentRss/835857.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/zxsoft/services/trackbacks/835857.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 转自：其名为鲲原帖：http://hi.baidu.com/sophiaandphilem/blog/item/a7360af731a25a23730eec6c.htmlAstar2007初赛第一场的...&nbsp;&nbsp;<a href='http://www.cnblogs.com/zxsoft/archive/2007/07/30/835857.html'>阅读全文</a><img src ="http://www.cnblogs.com/zxsoft/aggbug/835857.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://zxsoft.cnblogs.com/" target="_blank">张旋</a> 2007-07-30 02:55 <a href="http://www.cnblogs.com/zxsoft/archive/2007/07/30/835857.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Astar2007初赛第一场的题目2</title><link>http://www.cnblogs.com/zxsoft/archive/2007/07/19/823272.html</link><dc:creator>张旋</dc:creator><author>张旋</author><pubDate>Wed, 18 Jul 2007 19:25:00 GMT</pubDate><guid>http://www.cnblogs.com/zxsoft/archive/2007/07/19/823272.html</guid><wfw:comment>http://www.cnblogs.com/zxsoft/comments/823272.html</wfw:comment><comments>http://www.cnblogs.com/zxsoft/archive/2007/07/19/823272.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/zxsoft/comments/commentRss/823272.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/zxsoft/services/trackbacks/823272.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;今天查到了Astar2007的初赛题目，很感兴趣，便拿来做了一下，这是第二题。2.大话西游与数字游戏&#8220;叉烧鸡翅膀，我呀最爱吃！&#8230;&#8230;&#8221;，百...&nbsp;&nbsp;<a href='http://www.cnblogs.com/zxsoft/archive/2007/07/19/823272.html'>阅读全文</a><img src ="http://www.cnblogs.com/zxsoft/aggbug/823272.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://zxsoft.cnblogs.com/" target="_blank">张旋</a> 2007-07-19 03:25 <a href="http://www.cnblogs.com/zxsoft/archive/2007/07/19/823272.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>