<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[P_T_P的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/P_T_P</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; P_T_P]]></copyright><item><title><![CDATA[超级棒的手机流量管理软件，节约流量有技巧]]></title><link>https://blog.youkuaiyun.com/P_T_P/article/details/17567055</link><guid>https://blog.youkuaiyun.com/P_T_P/article/details/17567055</guid><author>P_T_P</author><pubDate>Wed, 25 Dec 2013 23:18:38 +0800</pubDate><description><![CDATA[过年回家了，手机卡异地漫游，流量超了7兆多，中国联通是大爷，扣我70多块钱，我都崩溃了。果断找了一款管理流量的软件，可以查流量还有多少，查杀隐蔽流量，功能多多，大家不妨下载试试，不要让运营商占便宜呀。需要的赶快了。

　　手机有扫描二维码工具的扫描下面的二维码（最简单的方法）

　　


　　如果不行扫描下面这个

　　

　　没有扫描二维码工具的，用下面的链接下载]]></description><category></category></item><item><title><![CDATA[用临界区实现互斥资源的访问]]></title><link>https://blog.youkuaiyun.com/P_T_P/article/details/3187482</link><guid>https://blog.youkuaiyun.com/P_T_P/article/details/3187482</guid><author>P_T_P</author><pubDate>Thu, 30 Oct 2008 21:11:00 +0800</pubDate><description><![CDATA[ #include #include int tickets=100;DWORD WINAPI fun1Proc(LPVOID lpParameter);DWORD WINAPI fun2Proc(LPVOID lpParameter);//创建一个临界区CRITICAL_SECTION g_cs;int main(){    HANDLE hThread1,hThread2;        //]]></description><category></category></item><item><title><![CDATA[用事件同步多线程]]></title><link>https://blog.youkuaiyun.com/P_T_P/article/details/3186565</link><guid>https://blog.youkuaiyun.com/P_T_P/article/details/3186565</guid><author>P_T_P</author><pubDate>Thu, 30 Oct 2008 17:30:00 +0800</pubDate><description><![CDATA[ #include#includeDWORD WINAPI fun1Proc(LPVOID lpParameter );DWORD WINAPI fun2Proc(LPVOID lpParameter );int tickets = 100;HANDLE hEvent;int main(){    HANDLE hThread1;    HANDLE hThread2;    /*    创建一个]]></description><category></category></item><item><title><![CDATA[用mutex同步多线程]]></title><link>https://blog.youkuaiyun.com/P_T_P/article/details/3186529</link><guid>https://blog.youkuaiyun.com/P_T_P/article/details/3186529</guid><author>P_T_P</author><pubDate>Thu, 30 Oct 2008 17:27:00 +0800</pubDate><description><![CDATA[ #include #include DWORD WINAPI ThreadProc1(LPVOID lpParameter );DWORD WINAPI ThreadProc2(LPVOID lpParameter );int index = 0;int tickets = 100;  HANDLE hMutex;int main(){    HANDLE hThread1 ;    HANDL]]></description><category></category></item><item><title><![CDATA[一个小程序]]></title><link>https://blog.youkuaiyun.com/P_T_P/article/details/3090671</link><guid>https://blog.youkuaiyun.com/P_T_P/article/details/3090671</guid><author>P_T_P</author><pubDate>Fri, 17 Oct 2008 11:21:00 +0800</pubDate><description><![CDATA[ #include#includeconst int N = 10;int main(){    int temp[N],res[N];    for(int i=0;i    srand(static_castint>(time(0)));    for(i=0;i    {        int k = rand() % (N-i);        res[i]=temp[k];       ]]></description><category></category></item><item><title><![CDATA[socket编程]]></title><link>https://blog.youkuaiyun.com/P_T_P/article/details/3081746</link><guid>https://blog.youkuaiyun.com/P_T_P/article/details/3081746</guid><author>P_T_P</author><pubDate>Wed, 15 Oct 2008 22:16:00 +0800</pubDate><description><![CDATA[服务器端：#include#include#includevoid main(){    WORD wVersionRequested;//要求的版本号    WSADATA wsaData;//that is to receive details of the Windows Sockets implementation.     int err;    /*    MAKEWORD(x,y)x]]></description><category></category></item><item><title><![CDATA[应聘周立公单片机公司]]></title><link>https://blog.youkuaiyun.com/P_T_P/article/details/3078420</link><guid>https://blog.youkuaiyun.com/P_T_P/article/details/3078420</guid><author>P_T_P</author><pubDate>Wed, 15 Oct 2008 09:57:00 +0800</pubDate><description><![CDATA[应聘背景：2008年10月11日接到该公司的通知，说是14号进行将进行宣讲会、笔试、面试和签协议。效率够高！！于是我就寻思：为啥——我-在没有得到心怡的众多公司的通知之前先得到这个通知呢？为啥——我—会与这个主要做硬件的公司有这样的缘分？为啥——该公司——会在短时间内签协议而让我必须做出痛苦的选择呢！现在我终于明白了！我——就是为认清自我，认清这个公司而参加这次招聘会的！！            ]]></description><category></category></item><item><title><![CDATA[模式匹配中的kmp算法]]></title><link>https://blog.youkuaiyun.com/P_T_P/article/details/3078338</link><guid>https://blog.youkuaiyun.com/P_T_P/article/details/3078338</guid><author>P_T_P</author><pubDate>Wed, 15 Oct 2008 09:39:00 +0800</pubDate><description><![CDATA[//:kmp//kmp算法是效率最高的模式匹配算法//其主要思想是：（假设i，j分别指向主串mStr和模式sStr的当前试匹配位置）当mStr[i]!=mStr[j]时并不//按传统的回溯i,j ，而是i不变j重一个算好的数组回溯，该数组可使得模式串向右//移动尽可能多的距离。//主要原理：假设当i，j失配的时候应该用模式的k字符与主串的j字符进行比较//则：  sStr[1~k-1] = mSt]]></description><category></category></item><item><title><![CDATA[一些决定]]></title><link>https://blog.youkuaiyun.com/P_T_P/article/details/3023547</link><guid>https://blog.youkuaiyun.com/P_T_P/article/details/3023547</guid><author>P_T_P</author><pubDate>Mon, 06 Oct 2008 19:09:00 +0800</pubDate><description><![CDATA[学习游戏编程了，我需要搞懂原理，然后实践原理。这条路我会走下去的！！！ ]]></description><category></category></item><item><title><![CDATA[一个简单的3D立方体C++源码]]></title><link>https://blog.youkuaiyun.com/P_T_P/article/details/3023537</link><guid>https://blog.youkuaiyun.com/P_T_P/article/details/3023537</guid><author>P_T_P</author><pubDate>Mon, 06 Oct 2008 18:59:00 +0800</pubDate><description><![CDATA[#include //Direct3D程序不需的头文件#include//如果要使用D3DX库就必须加入这个头文件#include#include#pragma comment(lib,"d3d9.lib")#pragma comment(lib,"d3dx9.lib")#pragma comment(lib,"winmm.lib")//4个本程序用到的全局变量LPDIRECT3D9 g_pD3D]]></description><category></category></item></channel></rss>