<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/dhm166</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dhm166]]></copyright><item><title><![CDATA[结构和类的区别]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/40536779</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/40536779</guid><author>dhm166</author><pubDate>Tue, 28 Oct 2014 10:33:47 +0800</pubDate><description><![CDATA[结构与类的区别是它们在内存中的存储方式、访问方式(类是存储在堆【 heap,上的引用类型,而
结构是存储在栈fsak9上的值类型)和它们的一些特征(如结构不支持继豹 。较小的数据类型使用结
构可提高性能。但在语法上,结构与类非常相似,主要的区别是使用关键字siuct代替dass来声明
结构。]]></description><category></category></item><item><title><![CDATA[Linux网络编程---服务器端基本框架]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/26954073</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/26954073</guid><author>dhm166</author><pubDate>Sun, 25 May 2014 13:40:12 +0800</pubDate><description><![CDATA[/*	服务器		          
话机	：socket        
绑定：bind
多路：listen
等待：accept				
接通：新socket
总机等别的电话，分机跟客户通信
通信：write/read 		
挂断分机：close
*/
#include
#include
#include
#include
#include
#include
#include
#include
]]></description><category></category></item><item><title><![CDATA[sql server修改数据库的兼容级别]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/26695263</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/26695263</guid><author>dhm166</author><pubDate>Fri, 23 May 2014 13:19:09 +0800</pubDate><description><![CDATA[/*
语法
ALTER DATABASE database_name 
SET COMPATIBILITY_LEVEL = { 80 | 90 | 100 }
 
参数
database_name 
要修改的数据库的名称。
COMPATIBILITY_LEVEL { 80 | 90 | 100 }
要使数据库与之兼容的 SQL Server 版本。该值必须为下列值之一：
= S]]></description><category></category></item><item><title><![CDATA[sql server 2008 通用表达式CTE]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/26694585</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/26694585</guid><author>dhm166</author><pubDate>Fri, 23 May 2014 13:15:24 +0800</pubDate><description><![CDATA[WITH TopSales (SalesPersonID,TerritoryID , NumberOfSales)
AS
(
	SELECT SalesPersonID,TerritoryID, COUNT(*)
	FROM Sales.SalesOrderHeader
	GROUP BY SalesPersonID,TerritoryID
)
	SELECT * FROM TopSales
	W]]></description><category></category></item><item><title><![CDATA[linux常见同步方式互斥量Mutex的使用方法]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/26507851</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/26507851</guid><author>dhm166</author><pubDate>Wed, 21 May 2014 21:00:20 +0800</pubDate><description><![CDATA[1. 初始化：
在Linux下, 线程的互斥量数据类型是pthread_mutex_t. 在使用前, 要对它进行初始化：
对于静态分配的互斥量, 可以把它设置为PTHREAD_MUTEX_INITIALIZER, 或者调用pthread_mutex_init.
对于动态分配的互斥量, 在申请内存（malloc）之后, 通过pthread_mutex_init进行初始化, 并且在释放内存（fr]]></description><category></category></item><item><title><![CDATA[模拟daemon函数]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/26405445</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/26405445</guid><author>dhm166</author><pubDate>Tue, 20 May 2014 23:00:19 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
int main()
{
	pid_t pid ;
	pid = fork();//创建子进程
	if(pid < 0)
	{
		perror("创建子进程失败");
		return -1;
	}
	else if(pid > 0)//结束父进程
	{
		_exit(0);
	}
	e]]></description><category></category></item><item><title><![CDATA[Linux中重定向及管道（ubuntu 终端命令）【转载】]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/26083129</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/26083129</guid><author>dhm166</author><pubDate>Sat, 17 May 2014 17:10:54 +0800</pubDate><description><![CDATA[1重定向

1.1     重定向符号

>              输出重定向到一个文件或设备 覆盖原来的文件
>!             输出重定向到一个文件或设备 强制覆盖原来的文件
>>            输出重定向到一个文件或设备 追加原来的文件
             输入重定向到一个程序

1.2标准错误重定向符号

2>            将一个]]></description><category></category></item><item><title><![CDATA[ubuntu man手册完善]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/25648535</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/25648535</guid><author>dhm166</author><pubDate>Mon, 12 May 2014 19:30:21 +0800</pubDate><description><![CDATA[ubuntu man手册完善
Linux提供了丰富的帮助手册，当你需要查看某个命令的参数时不必到处上网查找，只要man一下即可。
sudo apt-get install manpages-dev
sudo apt-get install manpages-posix
sudo apt-get install manpages-posix-dev
sudo apt-get install]]></description><category></category></item><item><title><![CDATA[unix环境编程---简单模拟  ls -l]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/24544629</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/24544629</guid><author>dhm166</author><pubDate>Sat, 26 Apr 2014 17:13:35 +0800</pubDate><description><![CDATA[这个博客很久没有管过了，今天学了一点unix环境编程，]]></description><category></category></item><item><title><![CDATA[POJ 3253 Fence Repair]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/11354121</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/11354121</guid><author>dhm166</author><pubDate>Sat, 07 Sep 2013 20:50:27 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;

int n,s;

struct cmp
{
   bool operator ()(int x, int y)
    {
        return x > y;
    }
};
priority_que]]></description><category></category></item><item><title><![CDATA[POJ 3069 Saruman's Army]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/11353685</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/11353685</guid><author>dhm166</author><pubDate>Sat, 07 Sep 2013 20:24:47 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
using namespace std;

int R , N;
int an[1010];

int cmp(const void *a ,const void *b)
{
    return *(int*)a-*(int*)b;
}

int main()
{
   ]]></description><category></category></item><item><title><![CDATA[POJ 3617 Best Cow Line]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/11311991</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/11311991</guid><author>dhm166</author><pubDate>Sat, 07 Sep 2013 13:59:16 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
using namespace std;

char s[4000];
int N;

int main()
{
    while(scanf("%d",&N)!=EOF)
    {
        for(int i=0;i<N;i++)
        {
    ]]></description><category></category></item><item><title><![CDATA[vijos P1662 最大配对]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/11265941</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/11265941</guid><author>dhm166</author><pubDate>Fri, 06 Sep 2013 21:05:38 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
using namespace std;

int n,k;
int an[100010];
int bn[100010];

int cmp1(const void *a,const void *b)
{
    return *(int *)a-*(int *)b;
}]]></description><category></category></item><item><title><![CDATA[vijos P1097 合并果子]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/11264759</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/11264759</guid><author>dhm166</author><pubDate>Fri, 06 Sep 2013 20:17:26 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;

int n,s;

struct cmp
{
   bool operator ()(int x, int y)
    {
        return x > y;
    }
};
priority_que]]></description><category></category></item><item><title><![CDATA[vijos P1097]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/11264727</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/11264727</guid><author>dhm166</author><pubDate>Fri, 06 Sep 2013 20:16:21 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;

int n,s;

struct cmp
{
   bool operator ()(int x, int y)
    {
        return x > y;
    }
};
priority_que]]></description><category></category></item><item><title><![CDATA[POJ 3278 Catch That Cow]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/11257059</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/11257059</guid><author>dhm166</author><pubDate>Fri, 06 Sep 2013 18:05:06 +0800</pubDate><description><![CDATA[BFS
#include
#include
#include
#include
#include
#include
#include
using namespace std;

int N ,K;
typedef pairP;
queueque;
int d[200010];

int bfs()
{
    int time=0;
    P p;
    p.first=N;
    p.s]]></description><category></category></item><item><title><![CDATA[poj 2386 Lake Counting]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/11119861</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/11119861</guid><author>dhm166</author><pubDate>Thu, 05 Sep 2013 11:29:42 +0800</pubDate><description><![CDATA[搜索bfs

#include
#include
#include
#include
int N,M;
char map[110][110];
bool flag[110][110];
//int dir[8][2]={-1,1,0,1,1,1,-1,0,1,0,-1,-1,0,-1,1,-1};

int dir[8][2]={ {-1,1},{0,1},{1,1},{1,0},{1,-1}]]></description><category></category></item><item><title><![CDATA[UVA 102 	Ecological Bin Packing]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/9735547</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/9735547</guid><author>dhm166</author><pubDate>Sat, 03 Aug 2013 21:22:32 +0800</pubDate><description><![CDATA[#include
#include
int B1,B2,B3,G1,G2,G3,C1,C2,C3;
char str[6][4]={"BCG","BGC","CBG","CGB","GBC","GCB"};
int an[6]={0};
int main()
{
    while(scanf("%d%d%d%d%d%d%d%d%d",&B1,&G1,&C1,&B2,&G2,&C2,&B3,&G3]]></description><category></category></item><item><title><![CDATA[汉诺塔hanoi]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/9396711</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/9396711</guid><author>dhm166</author><pubDate>Sun, 21 Jul 2013 11:06:36 +0800</pubDate><description><![CDATA[#include

void hanoi(char A,char B,char C,int n)
{
    if(n==1)
    {
        printf("Move disk %d from %c to %c\n",n,A,C);
    }
    else
    {
        hanoi(A,C,B,n-1);
        printf("Move disk %d ]]></description><category></category></item><item><title><![CDATA[uva 673	Parentheses Balance]]></title><link>https://blog.youkuaiyun.com/dhm166/article/details/9340051</link><guid>https://blog.youkuaiyun.com/dhm166/article/details/9340051</guid><author>dhm166</author><pubDate>Tue, 16 Jul 2013 10:31:35 +0800</pubDate><description><![CDATA[#include
#include
#include
using namespace std;
char s[200];
int T;
stackS;
int main()
{
    int i,len;
    scanf("%d",&T);
    getchar();
    while(T--)
    {
        gets(s);
        while(!S.empty(]]></description><category></category></item></channel></rss>