<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ I T 爬虫]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/iteye_17916</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; iteye_17916]]></copyright><item><title><![CDATA[1465  ：不容易系列之一]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82488842</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82488842</guid><author>iteye_17916</author><pubDate>Sun, 21 Apr 2013 22:46:23 +0800</pubDate><description><![CDATA[[align=center][color=darkblue][size=xx-large]不容易系列之一[/size][/color][/align]

[size=large][color=gray][b]
【1】 分析一下：状态f[i]的值为f[i-1]加上第i人的值，以及加上f[i-1]中恰有一个人的信没送错的值。
【2】 f[i-1]中恰有一个人的信没送错的值等于i-1封信中选一封...]]></description><category></category></item><item><title><![CDATA[2190 ： 悼念512汶川大地震遇难同胞——重建希望小学]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82486769</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82486769</guid><author>iteye_17916</author><pubDate>Thu, 11 Apr 2013 00:22:54 +0800</pubDate><description><![CDATA[[align=center][color=darkblue][size=xx-large]悼念512汶川大地震遇难同胞——重建希望小学[/size][/color][/align]

[size=large][color=gray][b]
【1】 这种题不难，主要是找规律。
【2】 这是一个简单递归求解的题，明白这个方程：f[m] = f[m-1] + 2*f[m-2];就行了，还要理解为...]]></description><category></category></item><item><title><![CDATA[2072 ：单词数]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82486755</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82486755</guid><author>iteye_17916</author><pubDate>Wed, 10 Apr 2013 22:32:06 +0800</pubDate><description><![CDATA[[color=darkblue][align=center][size=xx-large]单词数[/size][/align][/color]
[size=large][color=gray][b]
这个题，主要是字符串的简单操作，包括比较。
[1] 一开始做的时候，除了问题，主要是没有将s（输入串）处理完后再初始化。
[2] 还有，增加的那个清除缓存的语句，fflush(stdin),却...]]></description><category></category></item><item><title><![CDATA[2045 ：不容易系列之(3)—— LELE的RPG难题]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82486351</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82486351</guid><author>iteye_17916</author><pubDate>Tue, 09 Apr 2013 02:52:59 +0800</pubDate><description><![CDATA[[b][align=center][size=xx-large][color=blue]不容易系列之(3)—— LELE的RPG难题[/color][/size][/align][/b]

[size=large][color=gray][b]杭电oj，简单递推，注意要排除首尾相同的串，但是，不能排除长度小于n的首尾相同的串。这样才不会导致漏解。

[url=http://acm.hdu....]]></description><category></category></item><item><title><![CDATA[C语言编译器报错]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82486347</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82486347</guid><author>iteye_17916</author><pubDate>Tue, 09 Apr 2013 01:08:20 +0800</pubDate><description><![CDATA[[align=center][color=darkblue][b][u][size=xx-large]C语言编译器报错及其解决[/size][/u][/b]
[/color][/align]

[code=&quot;c&quot;]
编译器: TDM-GCC 4.7.1 32-bit
执行 gcc.exe...
gcc.exe &quot;C:\Users\Administrator\Desktop\test1\...]]></description><category></category></item><item><title><![CDATA[1071 : The area]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82486330</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82486330</guid><author>iteye_17916</author><pubDate>Mon, 08 Apr 2013 23:03:57 +0800</pubDate><description><![CDATA[[align=center][size=x-large][color=black][url=http://acm.hdu.edu.cn/showproblem.php?pid=1071]The area[/url][/color][/size][/align]

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/3276...]]></description><category></category></item><item><title><![CDATA[0\1背包问题和完全背包问题]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82485261</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82485261</guid><author>iteye_17916</author><pubDate>Mon, 01 Apr 2013 23:06:51 +0800</pubDate><description><![CDATA[             [align=center][size=x-large] [color=blue][u][b] 0\1背包问题和完全背包问题[/b][/u][/color][/size][/align]

[b][color=indigo]0/1背包问题，相对容易，而且是后面的其他背包问题的基础。以下算法是优化空间复杂度的。
原来的状态转移方程为：f[i][v] = Max {f[...]]></description><category></category></item><item><title><![CDATA[Given a m * n chess board , Find out minimum no of places to be covered to make ]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82483918</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82483918</guid><author>iteye_17916</author><pubDate>Sun, 24 Mar 2013 20:32:39 +0800</pubDate><description><![CDATA[Description
Given a m * n chess board , Find out minimum no of places to be covered to make it impossible to put a L shaped trinomo on it.

eg. In 2 * 2 chess board if you cover any 2 cells , It wi...]]></description><category></category></item><item><title><![CDATA[2013腾讯编程马拉松初赛第一场（3月21日）]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82483848</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82483848</guid><author>iteye_17916</author><pubDate>Sun, 24 Mar 2013 00:57:05 +0800</pubDate><description><![CDATA[[align=center][size=large][color=red][b]2013腾讯编程马拉松初赛第一场（3月21日）
湫湫系列故事——减肥记II
[/b][/color][/size][/align]
[size=medium][color=green]

Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 65535...]]></description><category></category></item><item><title><![CDATA[2013腾讯编程马拉松初赛第一场（3月21日）]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82483847</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82483847</guid><author>iteye_17916</author><pubDate>Sun, 24 Mar 2013 00:21:56 +0800</pubDate><description><![CDATA[[size=medium][b][color=red][align=center]2013腾讯编程马拉松初赛第一场（3月21日）
湫湫系列故事——减肥记I[/align][/color][/b]
[color=green]
Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
...]]></description><category></category></item><item><title><![CDATA[1002]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82483742</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82483742</guid><author>iteye_17916</author><pubDate>Sat, 23 Mar 2013 12:04:23 +0800</pubDate><description><![CDATA[[b][color=green][size=medium]杭电OJ
A + B Problem II

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 146895    Accepted Submission(s): 27722...]]></description><category></category></item><item><title><![CDATA[2013腾讯编程马拉松初赛第一场（3月21日）]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82483741</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82483741</guid><author>iteye_17916</author><pubDate>Sat, 23 Mar 2013 12:01:10 +0800</pubDate><description><![CDATA[[size=medium][align=center][b][color=red]2013腾讯编程马拉松初赛第一场（3月21日）
小Q系列故事——电梯里的爱情[/color][/size][/b][/align][color=green]

Time Limit: 300/100 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Ot...]]></description><category></category></item><item><title><![CDATA[2013腾讯编程马拉松初赛第二场（3月22日）]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82483740</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82483740</guid><author>iteye_17916</author><pubDate>Sat, 23 Mar 2013 11:58:00 +0800</pubDate><description><![CDATA[[align=center][size=large][color=red][b]2013腾讯编程马拉松初赛第二场（3月22日）[/b][/color][/size][/align]
[size=medium][color=green]小Q系列故事——为什么时光不能倒流

Time Limit: 300/100 MS (Java/Others)    Memory Limit: 65535/3...]]></description><category></category></item><item><title><![CDATA[浏览器被劫持——Web Search]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82452740</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82452740</guid><author>iteye_17916</author><pubDate>Thu, 03 Jan 2013 11:01:09 +0800</pubDate><description><![CDATA[[align=center][color=red][size=x-large]被Web Search劫持[/size][/color][/align]
[color=brown][b]就是这个坑爹货，见下图：[/b][/color]

[img]http://dl.iteye.com/upload/attachment/0078/7543/d34e3cc5-bf17-3901-a1ed-ae...]]></description><category></category></item><item><title><![CDATA[Android的低级错误]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82446802</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82446802</guid><author>iteye_17916</author><pubDate>Tue, 04 Dec 2012 00:41:20 +0800</pubDate><description><![CDATA[
[align=center][color=blue][size=large]error: Error parsing XML: unbound prefix 的错误原因及解决方案[/size][/color][/align]

[color=darkred]源代码如下：[/color]


[url=&quot;http://bai-du-bai-du123.iteye.com/&quot;][img]...]]></description><category></category></item><item><title><![CDATA[网页素材]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82442521</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82442521</guid><author>iteye_17916</author><pubDate>Thu, 15 Nov 2012 05:31:54 +0800</pubDate><description><![CDATA[[align=center][color=darkred][size=large]想学网页的看看（素材网址） [/size][/color][/align]
[size=medium]
非常图酷 http://www.tucoo.com
构图网： http://www.goto1.net
美图 http://www.6to23.com/s8/
搜图网： http://www.sophot...]]></description><category></category></item><item><title><![CDATA[五个实用组合键]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82442520</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82442520</guid><author>iteye_17916</author><pubDate>Thu, 15 Nov 2012 05:02:34 +0800</pubDate><description><![CDATA[
[size=xx-large][align=center][color=darkblue][b]电脑高手最常用的五个组合键[/b][/color][/align][/size]

    [color=red][size=x-large] winkey+d ：[/size][/color]

[size=medium]　　这是高手最常用的第一快捷组合键。这个快捷键组合可以将桌面上的所有...]]></description><category></category></item><item><title><![CDATA[如何在校外下载期刊全文]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82442519</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82442519</guid><author>iteye_17916</author><pubDate>Thu, 15 Nov 2012 04:24:59 +0800</pubDate><description><![CDATA[[size=large]
[b][align=center][color=darkred]如何在校外下载期刊全文--应对大家工作后的资料搜寻（转）  [/color]  [/align] [/b]
       马上就要工作了，觉得学校里面图书馆资料很多，并且很有用，都可以在中文CNKI数据库，和西文数据库荷兰DOS中全文下载，但是仅仅限于校内IP用户。到了工作单位上，想进入这些数据库查资料就...]]></description><category></category></item><item><title><![CDATA[如何找回断电、死机前未储存的Word,Excel文件]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82442518</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82442518</guid><author>iteye_17916</author><pubDate>Thu, 15 Nov 2012 04:15:52 +0800</pubDate><description><![CDATA[[color=darkred][size=x-large]如何找回断电、死机前未储存的Word,Excel文件[/size]
[/color]
[size=large][b][color=green][quote]大家常常会遇到一种情形，那就是当Word打到一半的时候，此时电脑当机了 ，如果很久没有存档 ，那真是欲哭无泪，所以在此告诉大家一个小秘方。


　　当电脑突然死机或断电时，Wo...]]></description><category></category></item><item><title><![CDATA[代码搜索引擎]]></title><link>https://blog.youkuaiyun.com/iteye_17916/article/details/82442516</link><guid>https://blog.youkuaiyun.com/iteye_17916/article/details/82442516</guid><author>iteye_17916</author><pubDate>Thu, 15 Nov 2012 02:24:42 +0800</pubDate><description><![CDATA[[align=center][size=x-large][color=blue]代码搜索引擎[/color][/size][/align]

最近很流行代码搜索，对开发人员确实帮助不少，这里做个汇总，如果有其他比较好的，可以推荐下～
推荐标准：快速、支持语言较全、Ajax支持
1、gotAPI [ http://start.gotapi.com/ ]
支持包括HTML, CSS, CSS...]]></description><category></category></item></channel></rss>