<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[在飞往老鸟的路途上]]></title><description><![CDATA[菜鸟的成长，技术成就梦想。]]></description><link>https://blog.youkuaiyun.com/jolt2</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; jolt2]]></copyright><item><title><![CDATA[DLL一点就通（好博文）]]></title><link>https://blog.youkuaiyun.com/jolt2/article/details/50884298</link><guid>https://blog.youkuaiyun.com/jolt2/article/details/50884298</guid><author>jolt2</author><pubDate>Mon, 14 Mar 2016 10:31:46 +0800</pubDate><description><![CDATA[DLL编写教程

半年不能上网，最近网络终于通了，终于可以更新博客了，写点什么呢？决定最近写一个编程技术系列，其内容是一些通用的编程技术。例如DLL，COM，Socket，多线程等等。这些技术的特点就是使用广泛，但是误解很多；网上教程很多，但是几乎没有什么优质良品。我以近几个月来的编程经验发现，很有必要好好的总结一下这些编程技术了。一来对自己是总结提高，二来可以方便光顾我博客的朋友。

好]]></description><category></category></item><item><title><![CDATA[4495: Least Prime factor 找到最小质因子P的第N小正整数]]></title><link>https://blog.youkuaiyun.com/jolt2/article/details/21198511</link><guid>https://blog.youkuaiyun.com/jolt2/article/details/21198511</guid><author>jolt2</author><pubDate>Fri, 14 Mar 2014 21:04:55 +0800</pubDate><description><![CDATA[4495: Least Prime factor 


时间限制(普通/Java):3000MS/9000MS 运行内存限制:65536KByte
总提交: 38 测试通过:3 

描述


Find the N-th smallest positive integer whose least prime factor is P.


输入


The input c]]></description><category></category></item><item><title><![CDATA[Help Me with the Game poj 2996 和 2993]]></title><link>https://blog.youkuaiyun.com/jolt2/article/details/8981686</link><guid>https://blog.youkuaiyun.com/jolt2/article/details/8981686</guid><author>jolt2</author><pubDate>Mon, 27 May 2013 20:36:17 +0800</pubDate><description><![CDATA[Help Me with the Game


Description

Your task is to read a picture of a chessboard position and print it in the chess notation.
Input

The input consists of an ASCII-art picture of a chessboa]]></description><category></category></item><item><title><![CDATA[1068 Parencodings（双向链表和数组的实现）]]></title><link>https://blog.youkuaiyun.com/jolt2/article/details/8981631</link><guid>https://blog.youkuaiyun.com/jolt2/article/details/8981631</guid><author>jolt2</author><pubDate>Mon, 27 May 2013 20:26:53 +0800</pubDate><description><![CDATA[Description

Let S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: 
q By an integer sequence P = p1 p2...pn where pi is the number of left parentheses]]></description><category></category></item><item><title><![CDATA[1573 Robot Motion （简单题）]]></title><link>https://blog.youkuaiyun.com/jolt2/article/details/8976431</link><guid>https://blog.youkuaiyun.com/jolt2/article/details/8976431</guid><author>jolt2</author><pubDate>Sun, 26 May 2013 14:04:02 +0800</pubDate><description><![CDATA[Description



A robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible
 instructions are]]></description><category></category></item><item><title><![CDATA[2632 Crashing Robots的解决方法]]></title><link>https://blog.youkuaiyun.com/jolt2/article/details/8976404</link><guid>https://blog.youkuaiyun.com/jolt2/article/details/8976404</guid><author>jolt2</author><pubDate>Sun, 26 May 2013 13:52:42 +0800</pubDate><description><![CDATA[Description

In a modernized warehouse, robots are used to fetch the goods. Careful planning is needed to ensure that the robots reach their destinations without crashing into each
 other. Of cours]]></description><category></category></item></channel></rss>