<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[董伟]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/github_24924857</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; github_24924857]]></copyright><item><title><![CDATA[基于Tinyhttp改写的http服务器（memcached，mysql）]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/47263861</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/47263861</guid><author>github_24924857</author><pubDate>Tue, 04 Aug 2015 00:13:07 +0800</pubDate><description><![CDATA[想基于Tinyhttp 写一个服务器，初步设想是这样的，把我上次写的那个很low的爬虫抓取天气信息的程序优化一下，然后抓取天气信息，存入mysql，然后再搭一层memcached，缓存天气信息，提高查询效率。前端一级页面有全国城市的连接，点开某个城市，从数据库里获得天气信息，返回二级页面。页面都是最简单的静态的 只有两行HTML这种样子的（页面这块有点玩不来啊。。。），然后考虑，考虑各种优化，提高]]></description><category></category></item><item><title><![CDATA[基于网络爬虫的全国气温排行程序/c++]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/47112257</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/47112257</guid><author>github_24924857</author><pubDate>Wed, 29 Jul 2015 10:13:03 +0800</pubDate><description><![CDATA[满足自己需求的 全国天气排行系统]]></description><category></category></item><item><title><![CDATA[PAT 1050 String Subtraction]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/46910879</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/46910879</guid><author>github_24924857</author><pubDate>Thu, 16 Jul 2015 13:59:16 +0800</pubDate><description><![CDATA[#include
#include//想用memset 在g++下要包这个头文件
#include
using namespace std;
int main()
{
	string s1, s2,s3;
	getline(cin, s1);
	getline(cin, s2);
	char a[256];

	memset(a, -1, sizeof(a));
	for (int i = 0; ]]></description><category></category></item><item><title><![CDATA[PAT 1046 Shortest Distance]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/46861685</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/46861685</guid><author>github_24924857</author><pubDate>Mon, 13 Jul 2015 13:56:24 +0800</pubDate><description><![CDATA[最淳朴的想法，把两个出口，正向走，方向走的距离都累加求和算出来，然后比较输出较小的
#include
#include
using namespace std;

int main()
{
	int num;
	cin >> num;
	int tmp;
	int sum = 0;
	vector vec;
	
	for (int i = 0; i < num; ++i)
	{
		cin >>]]></description><category></category></item><item><title><![CDATA[PAT 1036 Boys vs Girls]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/46832549</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/46832549</guid><author>github_24924857</author><pubDate>Fri, 10 Jul 2015 16:36:34 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;
typedef struct student
{
string name;
string sex;
string id;
int grade;
}stu;
int main()
{
int num;
cin >> num;
stu lowest_m;
lowest_m.grade = 101]]></description><category></category></item><item><title><![CDATA[PAT 1035 Password]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/46819117</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/46819117</guid><author>github_24924857</author><pubDate>Thu, 09 Jul 2015 16:53:27 +0800</pubDate><description><![CDATA[#include
#include
#include
using namespace std;
int main()
{
vector > vec;
pair tmp;
int num;
cin >> num;
int flag = 0;
int count = 0;
for (int i = 0; i 
{
cin >> tmp.first >> tmp.second]]></description><category></category></item><item><title><![CDATA[PAT 1031 Hello World for U]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/46788587</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/46788587</guid><author>github_24924857</author><pubDate>Tue, 07 Jul 2015 13:57:52 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;

int main()
{
	string s;
	cin>>s;
	int len = s.size()+2;
	int n1 = len /3;
	int bottom = len - 2*n1;
	int i=0;
	for(; i<n1-1;++i)
	{
		cout<<s[i];
		for(int j=0;]]></description><category></category></item><item><title><![CDATA[PAT 1027 Colors in Mars]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/46772357</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/46772357</guid><author>github_24924857</author><pubDate>Mon, 06 Jul 2015 11:24:23 +0800</pubDate><description><![CDATA[#include
using namespace std;

int main()
{
	char a[13] = {'0','1','2','3','4','5','6','7','8','9','A','B','C'};
	int num;
	int tmp;
	for(int i=0; i<3; ++i)
	{
		cin>>num;
		if(!i)
			cout<<"#";
		tmp]]></description><category></category></item><item><title><![CDATA[PAT 1019 General Palindromic Number]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/46762029</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/46762029</guid><author>github_24924857</author><pubDate>Sun, 05 Jul 2015 11:05:27 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;
int main()
{
	vector vec;
	int num;
	int base;
	cin>>num>>base;
	int digit;
	if(num == 0)
	{
		cout<<"Yes"<<endl;
		cout<<0;
		return 0;
	}
	while(num)
	{
		digi]]></description><category></category></item><item><title><![CDATA[PAT  1011 World Cup Betting]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/46755985</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/46755985</guid><author>github_24924857</author><pubDate>Sat, 04 Jul 2015 16:30:29 +0800</pubDate><description><![CDATA[#include
using namespace std;
int main()
{
	float a[3][3];
	float max = 0;
	int tag = 0;
	float profit = 1;
	char flag[3] = {'W','T','L'};
	for(int i=0; i<3;++i)
	{
		for(int j=0; j<3; ++j)
		{
			cin]]></description><category></category></item><item><title><![CDATA[PAT 1008 Elevator]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/46755963</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/46755963</guid><author>github_24924857</author><pubDate>Sat, 04 Jul 2015 16:28:16 +0800</pubDate><description><![CDATA[#include
using namespace std;
int main()
{
	int n;
	int cur = 0;
	int floor;
	int total = 0;
	int tmp;
	cin>>n;
	for(int i=0; i<n; ++i)
	{
		cin>>floor;
		tmp = floor - cur;
		total += (tmp > 0 ? tmp]]></description><category></category></item><item><title><![CDATA[PAT 1006 Sign In and Sign Out]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/46706709</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/46706709</guid><author>github_24924857</author><pubDate>Wed, 01 Jul 2015 09:46:15 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;
int main()
{
	typedef struct
	{
		string id;
		string login;
		string logout;
	}info;
	info min;
	info max;
	info tmp;
	int n;
	cin>>n;
	for(int i=0; i<n; ++i)
	]]></description><category></category></item><item><title><![CDATA[c++ 在控制台里用字符拼成图片]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/46489169</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/46489169</guid><author>github_24924857</author><pubDate>Sun, 14 Jun 2015 08:38:13 +0800</pubDate><description><![CDATA[读取一个文件，用 在屏幕上输出各种字符的方法，拼出这张图片]]></description><category></category></item><item><title><![CDATA[我所理解的红黑树删除]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/45937323</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/45937323</guid><author>github_24924857</author><pubDate>Sat, 23 May 2015 21:07:44 +0800</pubDate><description><![CDATA[看这篇文章 需要了解AVL树，知道AVL树的 删除，旋转调整等操作。这是我对红黑树删除的一些理解]]></description><category></category></item><item><title><![CDATA[dicards qualifiers]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/45534743</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/45534743</guid><author>github_24924857</author><pubDate>Wed, 06 May 2015 13:30:03 +0800</pubDate><description><![CDATA[stl_vector.h:43: error: passing ‘const vector >’ as ‘this’ argument of ‘T* vector::begin() [with T = int, Alloc = __default_alloc_template<false,
 0>]’ discards qualifiers


这个是我看了侯大师的STL源码剖析后，自己模]]></description><category></category></item><item><title><![CDATA[<为什么>要有virtual，及如何理解晚捆绑]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/45148609</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/45148609</guid><author>github_24924857</author><pubDate>Mon, 20 Apr 2015 12:38:39 +0800</pubDate><description><![CDATA[下边要说的是我在语言学习过程中遇到一些不理解的问题，为什么要有virtual机制，还有什么是晚捆绑。我当时学到这的时候可能困惑了一段时间，后来经过继续学习测试等，得出了自己的结论，仅在这记录一下。没有太多的代码实例，更像是我在啰嗦一些东西。
先说virtual
说道virtual肯定就想到多态，virtual是c++ 实现多态的一种方法，为什么要有这样一套虚机制？ 还是那些原则，代码复用 ”想]]></description><category></category></item><item><title><![CDATA[栈帧]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/45102325</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/45102325</guid><author>github_24924857</author><pubDate>Fri, 17 Apr 2015 21:26:33 +0800</pubDate><description><![CDATA[关于栈帧 我觉得这两篇文章讲的不错了，至少我看完能 明白了。
http://www.cnblogs.com/haolujun/archive/2011/03/26/1996525.html

http://blog.youkuaiyun.com/zsy2020314/article/details/9429707

写的很详细，我不打算和他们一样的从头分析这个栈帧了 。
 通过理解栈帧这个概念我觉]]></description><category></category></item><item><title><![CDATA[简单HashTable(链地址法哈希表)]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/44938079</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/44938079</guid><author>github_24924857</author><pubDate>Wed, 08 Apr 2015 11:06:44 +0800</pubDate><description><![CDATA[#define P 7
#define NULL_DATA -1
#define BUCKET_NODE_SIZE 3
#include
struct bucket_node
{
	int data[BUCKET_NODE_SIZE];
	bucket_node *next;
};
class HashTable
{
public:
	 HashTable()
	{
		for(int i=0;i]]></description><category></category></item><item><title><![CDATA[Linux下编程练习——bitset]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/44926419</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/44926419</guid><author>github_24924857</author><pubDate>Tue, 07 Apr 2015 21:52:13 +0800</pubDate><description><![CDATA[自己模拟实现一个简单的bitset]]></description><category></category></item><item><title><![CDATA[c程序生成过程]]></title><link>https://blog.youkuaiyun.com/github_24924857/article/details/44886525</link><guid>https://blog.youkuaiyun.com/github_24924857/article/details/44886525</guid><author>github_24924857</author><pubDate>Sun, 05 Apr 2015 11:28:19 +0800</pubDate><description><![CDATA[在vc6下写一个c程序，点一下编译 点一下链接，程序就能跑了。但我们的程序是如何从代码编程计算机课可执行的文件的，好像不是很清楚，这个IDE悄悄帮我们做了好多事情。 我们的程序从代码变成机器可执行的机器码，一般经过
预编译，编译，汇编，链接。这几个步骤，为什么是这样的几个步骤，我觉得这是和编程语言的发展历史有关。
      最早写程序与计算机交流用机器码，打纸袋的年代。后来发展出了汇编语言，]]></description><category></category></item></channel></rss>