<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[zonelight的专栏]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/zonelight</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; zonelight]]></copyright><item><title><![CDATA[cocos2d-x，CCMenu::initWithItems，无语啊]]></title><link>https://blog.csdn.net/zonelight/article/details/7434316</link><guid>https://blog.csdn.net/zonelight/article/details/7434316</guid><author>zonelight</author><pubDate>Sat, 07 Apr 2012 05:31:47 +0800</pubDate><description><![CDATA[http://www.cocos2d-x.org/boards/6/topics/7956?r=7988#message-7988

这函数不能用你写文档里干毛啊，233，这不科学啊！！！]]></description><category></category></item><item><title><![CDATA[QT中signal和slot的一些注意点保存]]></title><link>https://blog.csdn.net/zonelight/article/details/5768257</link><guid>https://blog.csdn.net/zonelight/article/details/5768257</guid><author>zonelight</author><pubDate>Tue, 27 Jul 2010 10:47:00 +0800</pubDate><description><![CDATA[<br />发起 <br />
.h <br />
signals:<br />
  void additem_signal();<br />
.cpp<br />
emit additem_signal();<br /><br />
接受<br />
.h<br />
private slots:<br />
    void addword_slot();<br />
.cpp<br />
发起的.h<br />
senwords_addForm *senw;<br />
se]]></description><category></category></item><item><title><![CDATA[LINUX系统调用sys_mkdir()中所得的pathname参数不是全路径，要将其转为全路径的解决办法。]]></title><link>https://blog.csdn.net/zonelight/article/details/5747428</link><guid>https://blog.csdn.net/zonelight/article/details/5747428</guid><author>zonelight</author><pubDate>Mon, 19 Jul 2010 20:49:00 +0800</pubDate><description><![CDATA[<br />asmlinkage long new_mkdir(const char __user *pathname,int mode)
{
    /*创建一个nameidata结构体*/
    struct nameidata nd;
    /*nd这里赋值完后里面就含有全路径的信息了*/
    int ret = path_lookup(pathname,LOOKUP_DIRECTORY,&nd);     
    /*打印出的是所创建的文件夹的名称，比如mydir*/
   ]]></description><category></category></item><item><title><![CDATA[教训阿，在LINUX下看来不能所有的程序都CHMOD777和SUDO]]></title><link>https://blog.csdn.net/zonelight/article/details/5059194</link><guid>https://blog.csdn.net/zonelight/article/details/5059194</guid><author>zonelight</author><pubDate>Wed, 23 Dec 2009 02:28:00 +0800</pubDate><description><![CDATA[首先这么做安全隐患自不必说了。主要要说的是这次安装QT4.6的问题，下载了官网QT4.6的BIN文件，开始安装。首先给BIN文件加执行权限，直接就CHMOD 777过去了，然后SUDO执行，安装完后，发现QMAKE不能用。于是卸载，想到是不是权限问题，于是把权限改低点执行，CHMOD u+x，然后不用SUDO直接来启动BIN，安装完毕后，一切OK。看来以后不能老是给高权限了阿。。。]]></description><category></category></item><item><title><![CDATA[PKU3356 AGTC (简单DP)]]></title><link>https://blog.csdn.net/zonelight/article/details/4853430</link><guid>https://blog.csdn.net/zonelight/article/details/4853430</guid><author>zonelight</author><pubDate>Sun, 22 Nov 2009 22:40:00 +0800</pubDate><description><![CDATA[                                                                                                             AGTCTime Limit: 1000MSMemory Limit: 65536KTotal Submissio]]></description><category></category></item><item><title><![CDATA[PKU2688 Cleaning Robot(BFS + DFS)]]></title><link>https://blog.csdn.net/zonelight/article/details/4769153</link><guid>https://blog.csdn.net/zonelight/article/details/4769153</guid><author>zonelight</author><pubDate>Wed, 04 Nov 2009 21:16:00 +0800</pubDate><description><![CDATA[ /*                                                                                                      Cleaning RobotTime Limit: 1000MS        Memory Limit: 65536KTotal Submissions: 1592      ]]></description><category></category></item><item><title><![CDATA[PKU2192 Zipper(DP+记忆化)]]></title><link>https://blog.csdn.net/zonelight/article/details/4581803</link><guid>https://blog.csdn.net/zonelight/article/details/4581803</guid><author>zonelight</author><pubDate>Tue, 22 Sep 2009 22:14:00 +0800</pubDate><description><![CDATA[/*  ZipperTime Limit: 1000MS        Memory Limit: 65536KTotal Submissions: 6751        Accepted: 2244DescriptionGiven three strings, you are to determine whether the third string can b]]></description><category></category></item><item><title><![CDATA[PKU1887 Testing the CATCHER (最长不升子序列)]]></title><link>https://blog.csdn.net/zonelight/article/details/4551156</link><guid>https://blog.csdn.net/zonelight/article/details/4551156</guid><author>zonelight</author><pubDate>Mon, 14 Sep 2009 13:53:00 +0800</pubDate><description><![CDATA[/*                                                                                Testing the CATCHERTime Limit: 1000MS        Memory Limit: 30000KTotal Submissions: 6430        Accepted: 2349]]></description><category></category></item><item><title><![CDATA[PKU1631Bridging signals(最长不降子序列)]]></title><link>https://blog.csdn.net/zonelight/article/details/4516545</link><guid>https://blog.csdn.net/zonelight/article/details/4516545</guid><author>zonelight</author><pubDate>Thu, 03 Sep 2009 18:47:00 +0800</pubDate><description><![CDATA[/*Bridging signalsTime Limit: 1000MS        Memory Limit: 10000KTotal Submissions: 4649        Accepted: 2563DescriptionOh no, theyve done it again, cries the chief designer at the Wafe]]></description><category></category></item><item><title><![CDATA[pku1160 Post Office 中等难度的DP]]></title><link>https://blog.csdn.net/zonelight/article/details/4484042</link><guid>https://blog.csdn.net/zonelight/article/details/4484042</guid><author>zonelight</author><pubDate>Tue, 25 Aug 2009 18:00:00 +0800</pubDate><description><![CDATA[/*Post OfficeTime Limit: 1000MS        Memory Limit: 10000KTotal Submissions: 6697        Accepted: 3531DescriptionThere is a straight highway with villages alongside the highway. The high]]></description><category></category></item><item><title><![CDATA[PKU1579 Function Run Fun （DP水题）]]></title><link>https://blog.csdn.net/zonelight/article/details/4385766</link><guid>https://blog.csdn.net/zonelight/article/details/4385766</guid><author>zonelight</author><pubDate>Tue, 28 Jul 2009 08:22:00 +0800</pubDate><description><![CDATA[/*  Function Run FunTime Limit: 1000MS        Memory Limit: 10000KTotal Submissions: 6329        Accepted: 3475DescriptionWe all love recursion! Dont we?Consider a three-paramet]]></description><category></category></item><item><title><![CDATA[pku1609 Tiling Up Blocks (DP题)]]></title><link>https://blog.csdn.net/zonelight/article/details/4316933</link><guid>https://blog.csdn.net/zonelight/article/details/4316933</guid><author>zonelight</author><pubDate>Thu, 02 Jul 2009 19:02:00 +0800</pubDate><description><![CDATA[Tiling Up BlocksTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 1937Accepted: 755DescriptionMichaelThe Kid receives an interesting game s]]></description><category></category></item><item><title><![CDATA[PKU1080 Human Gene Functions]]></title><link>https://blog.csdn.net/zonelight/article/details/4313594</link><guid>https://blog.csdn.net/zonelight/article/details/4313594</guid><author>zonelight</author><pubDate>Wed, 01 Jul 2009 16:13:00 +0800</pubDate><description><![CDATA[/*Human Gene FunctionsTime Limit: 1000MS        Memory Limit: 10000KTotal Submissions: 6974        Accepted: 3861DescriptionIt is well known that a human gene can be considered as a sequen]]></description><category></category></item><item><title><![CDATA[pku1062 昂贵的聘礼（Memory Limit Exceeded。。。。。。）]]></title><link>https://blog.csdn.net/zonelight/article/details/4303515</link><guid>https://blog.csdn.net/zonelight/article/details/4303515</guid><author>zonelight</author><pubDate>Sat, 27 Jun 2009 19:22:00 +0800</pubDate><description><![CDATA[ /*昂贵的聘礼Time Limit: 1000MS        Memory Limit: 10000KTotal Submissions: 8052        Accepted: 1922Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这]]></description><category></category></item><item><title><![CDATA[PKU2676 Sudoku 数独]]></title><link>https://blog.csdn.net/zonelight/article/details/4211818</link><guid>https://blog.csdn.net/zonelight/article/details/4211818</guid><author>zonelight</author><pubDate>Sun, 24 May 2009 01:54:00 +0800</pubDate><description><![CDATA[/*SudokuTime Limit: 2000MS        Memory Limit: 65536KTotal Submissions: 4283        Accepted: 1934        Special JudgeDescriptionSudoku is a very simple task. A square table with 9 r]]></description><category></category></item><item><title><![CDATA[pku3414 POTS(哦也。。。。。。。。又输了。。这是第几次无耻发别人代码AC了。。。。。。我垃圾我笨我傻我真TMD不是东西！！！！]]></title><link>https://blog.csdn.net/zonelight/article/details/4207713</link><guid>https://blog.csdn.net/zonelight/article/details/4207713</guid><author>zonelight</author><pubDate>Fri, 22 May 2009 02:41:00 +0800</pubDate><description><![CDATA[/*PotsTime Limit: 1000MS        Memory Limit: 65536KTotal Submissions: 1980        Accepted: 866        Special JudgeDescriptionYou are given two pots, having the volume of A and B liters respectively]]></description><category></category></item><item><title><![CDATA[PKU3087 Shuffle'm Up (不知道哪错。。。。。。。。。。]]></title><link>https://blog.csdn.net/zonelight/article/details/4204850</link><guid>https://blog.csdn.net/zonelight/article/details/4204850</guid><author>zonelight</author><pubDate>Wed, 20 May 2009 22:03:00 +0800</pubDate><description><![CDATA[/*Shufflem UpTime Limit: 1000MS        Memory Limit: 65536KTotal Submissions: 1467        Accepted: 678DescriptionA common pastime for poker players at a poker table is to shuffle stacks of chips. Sh]]></description><category></category></item><item><title><![CDATA[pku3126 Prime Path BFS]]></title><link>https://blog.csdn.net/zonelight/article/details/4195632</link><guid>https://blog.csdn.net/zonelight/article/details/4195632</guid><author>zonelight</author><pubDate>Sun, 17 May 2009 20:46:00 +0800</pubDate><description><![CDATA[#include #include #include #include using namespace std;int visited[10000] = {0};int endcost[10000] = {0};int prime(int number){    if(number % 2 == 0)    {        return 0;    }    else    {        f]]></description><category></category></item><item><title><![CDATA[PKU1426 Find The Multiple (memory limit超过了。。。。）]]></title><link>https://blog.csdn.net/zonelight/article/details/4184480</link><guid>https://blog.csdn.net/zonelight/article/details/4184480</guid><author>zonelight</author><pubDate>Thu, 14 May 2009 19:00:00 +0800</pubDate><description><![CDATA[#include #include using namespace std;void bfs(int number,queue m){    if(m.front() % number == 0)    {        cout        return;    }    else    {            m.push(m.front() * 10);        m.push(m.]]></description><category></category></item><item><title><![CDATA[PKU3278 Catch That Cow 基础广搜]]></title><link>https://blog.csdn.net/zonelight/article/details/4153234</link><guid>https://blog.csdn.net/zonelight/article/details/4153234</guid><author>zonelight</author><pubDate>Wed, 06 May 2009 00:11:00 +0800</pubDate><description><![CDATA[Catch That CowTime Limit: 2000MS        Memory Limit: 65536KTotal Submissions: 9268        Accepted: 2791DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch h]]></description><category></category></item></channel></rss>