<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[                    博观而约取，厚积而薄发]]></title><description><![CDATA[               尘世如潮人如水，只叹江湖几人回]]></description><link>https://blog.youkuaiyun.com/wankaiming</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wankaiming]]></copyright><item><title><![CDATA[排序算法总结]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8249770</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8249770</guid><author>wankaiming</author><pubDate>Sun, 02 Dec 2012 22:43:15 +0800</pubDate><description><![CDATA[排序算法总结





按平均时间将排序分为四类：

（1）平方阶(O(n2))排序
    　一般称为简单排序，例如直接插入、直接选择和冒泡排序；

（2）线性对数阶(O(nlgn))排序
    　如快速、堆和归并排序；

（3）O(n1+￡)阶排序
    　￡是介于0和1之间的常数，即0

（4）线性阶(O(n))排序
    　如桶、箱和基数排序。]]></description><category></category></item><item><title><![CDATA[ZOJ_1292_Integer Inquiry]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8159768</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8159768</guid><author>wankaiming</author><pubDate>Wed, 07 Nov 2012 21:54:23 +0800</pubDate><description><![CDATA[Integer Inquiry

Time Limit: 2 Seconds      Memory Limit: 65536 KB

One of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 33]]></description><category></category></item><item><title><![CDATA[C++ 的 string构造函数]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8154542</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8154542</guid><author>wankaiming</author><pubDate>Tue, 06 Nov 2012 18:55:06 +0800</pubDate><description><![CDATA[之所以抛弃char*的字符串而选用C++标准程序库中的string类，是因为他和前者比较起来，不必 
担心内存是否足够、字符串长度等等，而且作为一个类出现，他集成的操作函数足以完成我们大多数情况下(甚至是100%)的需要。我们可以用 = 进行赋值操作，== 
进行比较，+ 做串联（是不是很简单?）。我们尽可以把它看成是C++的基本数据类型。 

首先，为了在我们的程序中使用string类型]]></description><category></category></item><item><title><![CDATA[ZOJ_1251_Box of Bricks]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8146931</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8146931</guid><author>wankaiming</author><pubDate>Sun, 04 Nov 2012 22:20:04 +0800</pubDate><description><![CDATA[Box of Bricks

Time Limit: 2 Seconds      Memory Limit: 65536 KB

Little Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. ``Look]]></description><category></category></item><item><title><![CDATA[ZOJ_1242_Carbon Dating]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8142388</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8142388</guid><author>wankaiming</author><pubDate>Fri, 02 Nov 2012 22:00:03 +0800</pubDate><description><![CDATA[Carbon Dating

Time Limit: 2 Seconds      Memory Limit: 65536 KB

Until the second half of the 20th century, determining the actual age of an archaeological find had been more or less a matter of]]></description><category></category></item><item><title><![CDATA[ZOJ_1241_Geometry Made Simple]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8142149</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8142149</guid><author>wankaiming</author><pubDate>Fri, 02 Nov 2012 20:28:29 +0800</pubDate><description><![CDATA[Geometry Made Simple

Time Limit: 2 Seconds      Memory Limit: 65536 KB

Mathematics can be so easy when you have a computer. Consider the following example. You probably know that in a right-angl]]></description><category></category></item><item><title><![CDATA[Insertion_Sort(插入排序)]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8138638</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8138638</guid><author>wankaiming</author><pubDate>Thu, 01 Nov 2012 21:42:51 +0800</pubDate><description><![CDATA[自己编一遍。。。防止遗忘，同时增加熟练度。罗列下来自百科的算法描述和基本步骤


算法描述
　　一般来说，插入排序都采用in-place在数组上实现。具体算法描述如下：


　　⒈ 从第一个元素开始，该元素可以认为已经被排序


　　⒉ 取出下一个元素，在已经排序的元素序列中从后向前扫描


　　⒊ 如果该元素（已排序）大于新元素，将该元素移到下一位置


　　⒋]]></description><category></category></item><item><title><![CDATA[ZOJ_1240_IBM Minus One]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8138421</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8138421</guid><author>wankaiming</author><pubDate>Thu, 01 Nov 2012 20:31:58 +0800</pubDate><description><![CDATA[IBM Minus One

Time Limit: 2 Seconds      Memory Limit: 65536 KB

You may have heard of the book '2001 - A Space Odyssey' by Arthur C. Clarke, or the film of the same name by Stanley Kubrick. In i]]></description><category></category></item><item><title><![CDATA[ZOJ_1216_Deck]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8138396</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8138396</guid><author>wankaiming</author><pubDate>Thu, 01 Nov 2012 20:29:10 +0800</pubDate><description><![CDATA[Deck

Time Limit: 2 Seconds      Memory Limit: 65536 KB

Scenario
A single playing card can be placed on a table, carefully, so that the short edges of the card are parallel to the table's edge,]]></description><category></category></item><item><title><![CDATA[fixed和setprecision等C++格式控制的函数使用]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8134347</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8134347</guid><author>wankaiming</author><pubDate>Wed, 31 Oct 2012 21:32:41 +0800</pubDate><description><![CDATA[cout


setiosflags 是包含在命名空间iomanip 中的C++ 操作符，该操作符的作用是执行由有参数指定


区域内的动作；


iso::fixed 是操作符setiosflags 的参数之一，该参数指定的动作是以带小数点的形式表示浮点


数，并且在允许的精度范围内尽可能的把数字移向小数点右侧；


iso::right 也是setiosflag]]></description><category></category></item><item><title><![CDATA[ZOJ_1205_Martian Addition]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8130422</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8130422</guid><author>wankaiming</author><pubDate>Tue, 30 Oct 2012 22:06:46 +0800</pubDate><description><![CDATA[Martian Addition

Time Limit: 2 Seconds      Memory Limit: 65536 KB

  In the 22nd Century, scientists have discovered intelligent residents live on the Mars. Martians are very fond of mathematics]]></description><category></category></item><item><title><![CDATA[写给新手程序员的一封信]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8129763</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8129763</guid><author>wankaiming</author><pubDate>Tue, 30 Oct 2012 18:48:07 +0800</pubDate><description><![CDATA[前面几本书来源请看：http://stackoverflow.com/questions/1711/what-is-the-single-most-influential-book-every-programmer-should-read?page=1&;tab=votes#tab-top 
　　 
　　后面为个人自主添加 
　　 
　　附《程序员技术练级攻略》 
　　来源：陈皓 htt]]></description><category></category></item><item><title><![CDATA[cou和cerr的区别]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8128278</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8128278</guid><author>wankaiming</author><pubDate>Tue, 30 Oct 2012 14:26:33 +0800</pubDate><description><![CDATA[cerr与cout的主要区分就是，cout输出的信息可以重定向，而cerr只能输出到标准输出（显示器）上。 　　例如下面程序编译后生成test.exe
// test.cpp
#include 
int main()
{ 
　　cout << "hello world---cout" << endl ;
 　　cerr << "hello world---cerr" << endl ;
 　　re]]></description><category></category></item><item><title><![CDATA[ZOJ_1201_Inversion]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8125841</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8125841</guid><author>wankaiming</author><pubDate>Mon, 29 Oct 2012 21:56:50 +0800</pubDate><description><![CDATA[Inversion

Time Limit: 2 Seconds      Memory Limit: 65536 KB

  Let { A1,A2,...,An } be a permutation of the set{ 1,2,..., n}. If i  Aj then the pair (Ai,Aj) is called an "inversion" of the permut]]></description><category></category></item><item><title><![CDATA[codeblocks中断点无效问题的解决]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8125941</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8125941</guid><author>wankaiming</author><pubDate>Mon, 29 Oct 2012 20:47:41 +0800</pubDate><description><![CDATA[经过本人不懈努力，终于研究出了在code::blocks中进行debug的方法！啥？什么是debug？就是老师经常演示的监视变量，设置断点啊！大家可以彻底抛弃黑乎乎又过时的TC 2.0，进入GUI界面编写程序的时代！

 

Step1.确保你的工程所在的路径中没有中文字符。

如：F:programming8-38-3.c √

F:programming上机课8-38-3.c]]></description><category></category></item><item><title><![CDATA[ZOJ_1151_Word Reversal]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8124665</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8124665</guid><author>wankaiming</author><pubDate>Mon, 29 Oct 2012 15:50:33 +0800</pubDate><description><![CDATA[Word Reversal

Time Limit: 2 Seconds      Memory Limit: 65536 KB

For each list of words, output a line with each word reversed without changing the order of the words.

This problem contains mu]]></description><category></category></item><item><title><![CDATA[字符串分割(C++)]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8113110</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8113110</guid><author>wankaiming</author><pubDate>Thu, 25 Oct 2012 22:13:03 +0800</pubDate><description><![CDATA[论坛问来的字符串分割代码，值得借鉴。
vector vec;
    char strText[] = "what a nice day!";
    char seps[] = " ";
    char* token = strtok(strText, seps);
    string str;
    while(NULL != token)
    {
        str = to]]></description><category></category></item><item><title><![CDATA[Code::Blocks代码自动提示设置及常用快捷键]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8113086</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8113086</guid><author>wankaiming</author><pubDate>Thu, 25 Oct 2012 22:07:45 +0800</pubDate><description><![CDATA[Code::Blocks代码自动提示设置及常用快捷键（适用windows和linux）


1）以下需要设置的地方均在Settings->Editor...弹出的对话框中。

2）不少命令都可针对当前行或选中的代码块，下文简称当前行或选中块。

==日常编辑==

    • 按住Ctrl滚滚轮，代码的字体会随你心意变大变小，对保护视力特别有好处。 
    • 在编辑区按住右]]></description><category></category></item><item><title><![CDATA[字符串分割(C++)]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8111651</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8111651</guid><author>wankaiming</author><pubDate>Thu, 25 Oct 2012 16:22:58 +0800</pubDate><description><![CDATA[经常碰到字符串分割的问题，这里总结下，也方便我以后使用。

一、用strtok函数进行字符串分割

原型： char *strtok(char *str, const char *delim);

功能：分解字符串为一组字符串。

参数说明：str为要分解的字符串，delim为分隔符字符串。

返回值：从str开头开始的一个个被分割的串。当没有被分割的串时则返回NULL。]]></description><category></category></item><item><title><![CDATA[ZOJ_1115_Digital Roots]]></title><link>https://blog.youkuaiyun.com/wankaiming/article/details/8111147</link><guid>https://blog.youkuaiyun.com/wankaiming/article/details/8111147</guid><author>wankaiming</author><pubDate>Thu, 25 Oct 2012 15:28:45 +0800</pubDate><description><![CDATA[Digital Roots

Time Limit: 2 Seconds      Memory Limit: 65536 KB

Background

The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a si]]></description><category></category></item></channel></rss>