<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[x_unknown的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/x_unknown</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; x_unknown]]></copyright><item><title><![CDATA[模拟卖票系统]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/77338361</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/77338361</guid><author>x_unknown</author><pubDate>Thu, 17 Aug 2017 19:03:01 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 

int t = 100;

pthread_mutex_t mutex;

void *Sell(void* v)
{
	int window = (int)v;
	
	printf("第%d个窗口开始卖票\n",window);
	
	while(1)
	{
		int time = rand(]]></description><category></category></item><item><title><![CDATA[字符串的“加密”]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/77168774</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/77168774</guid><author>x_unknown</author><pubDate>Mon, 14 Aug 2017 20:36:39 +0800</pubDate><description><![CDATA[#include 
#include 
#include 

#define  SIZE 1024

void  nixu(int* p)
{
	int *p1 = p;     
	int *p2 = p + sizeof(p)/sizeof(p[0]) - 1;

	while (p1 < p2)
	{
		int tmp = *p1;
		*(p1++) = *p2;
		*(p2--) =]]></description><category></category></item><item><title><![CDATA[标准I/O]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/77072908</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/77072908</guid><author>x_unknown</author><pubDate>Thu, 10 Aug 2017 20:02:35 +0800</pubDate><description><![CDATA[fopen函数
FILE *fopFILE *fopen(const char *path, const char *mode);
fopen打开由path指定的文件，并把它与一个文件流关联起来。mode参数指定文件的打开方式。执行成功返回一个非空的FILE*指针，失败时返回NULL.
其中mode参数的取值有：
r,rb:只读方式打开；
w,wb：以只写方式打开，并把文件长度截短为0；]]></description><category></category></item><item><title><![CDATA[进程控制]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/77011950</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/77011950</guid><author>x_unknown</author><pubDate>Wed, 09 Aug 2017 19:25:48 +0800</pubDate><description><![CDATA[进程的生命周期：
创建：每个进程都由其父进程创建。父进程可以创建子进程，子进程又可以创建子进程的子进程。
运行：多个进程可以同时存在，进程之间可以进行通信。
终止：结束一个进程的运行。

获取id的函数  pid_t getpid
pid_t getpid（void）  获取当前进程的id

pid_t getppid（void）获取父进程的id



进程创建函数fork]]></description><category></category></item><item><title><![CDATA[停车场（2）]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76809991</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76809991</guid><author>x_unknown</author><pubDate>Mon, 07 Aug 2017 10:03:14 +0800</pubDate><description><![CDATA[#include "L.h"
#include 
#include 

#define  FALSE  0
#define  TRUE   1

int count = 0;
int a     = 0;

int main()
{
	Queue* Wait = Create_Queue();
	Queue* Stop = Create_Queue();
	LinkStack* Give = Cr]]></description><category></category></item><item><title><![CDATA[停车场（1）]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76808559</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76808559</guid><author>x_unknown</author><pubDate>Mon, 07 Aug 2017 09:58:58 +0800</pubDate><description><![CDATA[#include "L.h"
#include 
#include 

Queue* Create_Queue()//创建一个队列
{
	Queue * q = (Queue*)malloc(sizeof(Queue)/sizeof(char));
	if (q == NULL)
	{
		return NULL;
	}
	
	// 置空队
	q->front = NULL;
	q->rear  ]]></description><category></category></item><item><title><![CDATA[二叉树的实现]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76806590</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76806590</guid><author>x_unknown</author><pubDate>Mon, 07 Aug 2017 09:53:57 +0800</pubDate><description><![CDATA[BTree *Create_BTree()//创建一个二叉树
{
	BTree *btree = (BTree*)malloc(sizeof(BTree)/sizeof(char));
	if (btree == NULL)
		return NULL;
	
	btree->count = 0;
	btree->root  = NULL;
	
	
	return btree;
}


int Bt]]></description><category></category></item><item><title><![CDATA[计算器（2）]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76804710</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76804710</guid><author>x_unknown</author><pubDate>Mon, 07 Aug 2017 09:32:39 +0800</pubDate><description><![CDATA[#include "Calculator.h"
#include 
#include 
#include 
#define  FIRST  2;
#define  SECOND 3;
#define  THIRD  4;

int sum;
int main()
{
	Num *s;
	Ch  *p;
	char str[100];
	
	Num_Init (s);
	Ch_Init (p);
	]]></description><category></category></item><item><title><![CDATA[计算器（1）]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76804579</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76804579</guid><author>x_unknown</author><pubDate>Mon, 07 Aug 2017 09:30:27 +0800</pubDate><description><![CDATA[#include "Calculator.h"
#include "error.h"
#include 

int Num_Init (Num *s)
{
	if(s == NULL)
	{
		return FALSE;
	}
	
	s->top = -1;
	return TRUE;
}

int Ch_Init (Ch *s)
{
	if(s == NULL)
	{
		return FAL]]></description><category></category></item><item><title><![CDATA[C语言树的建立]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76803968</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76803968</guid><author>x_unknown</author><pubDate>Mon, 07 Aug 2017 09:24:27 +0800</pubDate><description><![CDATA[#include "SqQueue.h"

int InitQueue (Queue *q)//建一个顺序队列并置空
{
	if (q == NULL)
	{
		return FALSE;
	}
	
	q->front = 0;
	q->rear  = 0;
	
	return TRUE;
}

int QueueEmpty (Queue *q)//判断队列是否为空，为空返回真，否则返回假
{]]></description><category></category></item><item><title><![CDATA[顺序栈]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76800494</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76800494</guid><author>x_unknown</author><pubDate>Mon, 07 Aug 2017 09:14:11 +0800</pubDate><description><![CDATA[#include "SqStack.h"


int InitStack (Stack *S)//置空栈
{
	if (S == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	S->top = -1; 
}
int StackEmpty (Stack *S)//判断栈是否为空，空返回真，不空返回假
{
	if (S == NULL)
	{
		errn]]></description><category></category></item><item><title><![CDATA[编一个C函数，子串在主串中出现多少次]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76793381</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76793381</guid><author>x_unknown</author><pubDate>Sun, 06 Aug 2017 20:22:37 +0800</pubDate><description><![CDATA[#include 
#include 
int main()
{
	int a=0,b=0,count=0,j=0,i=0;
    char ch1[100],ch2[100];
	printf("Please enter your string:");
	gets(ch1);
	printf("Please enter your substring:");
	gets(ch2);
	a=str]]></description><category></category></item><item><title><![CDATA[编程实现统计某年某月份的天数]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76793156</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76793156</guid><author>x_unknown</author><pubDate>Sun, 06 Aug 2017 20:18:51 +0800</pubDate><description><![CDATA[#include 
int main()
{
	int a,b;
	char c;
	printf("Please enter the month to query, format such as: 2017.7.\n");
	scanf("%d%c%d", &a, &c, &b);
	
	switch (b)
	{
		case 2 :
			if(a % 4 != 0 ||(a % 4 ==0]]></description><category></category></item><item><title><![CDATA[C语言系统编程]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76792609</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76792609</guid><author>x_unknown</author><pubDate>Sun, 06 Aug 2017 20:12:18 +0800</pubDate><description><![CDATA[在Linux中，为了更好地保护内核空间，程序的运行空间分为内核空间和用户空间(也就是常称的内核态和用户态)，它们分别运行在不同的级别上，在逻辑上是相互隔离的。因此，用户进程在通常情况下不允许访问内核数据，也无法使用内核函数，它们只能在用户空间操作用户数据，调用用户空间的函数。
所有执行I/O操作的系统调用使用文件描述符来表示打开的文件。
 文件描述符是一个非负整数。
 文件描述符可以表示各种]]></description><category></category></item><item><title><![CDATA[C语言递归李白打酒]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76792586</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76792586</guid><author>x_unknown</author><pubDate>Sun, 06 Aug 2017 20:10:42 +0800</pubDate><description><![CDATA[void libai(int store, int flower,int alco, int pre, char *ch, int index)  
{  
    if(store == 0 && flower == 0)  
    {  
        if(alco == 0 && pre == 0)  
        {  
            int i;  
            for(i = 0;i < 15; i++)  
            {  
           ]]></description><category></category></item><item><title><![CDATA[输入一个整数a,再输入两个整数p1,p2(p1,p2<32),输出该整数的二进制表示方法中从右端开始的p1到p2位.]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76792449</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76792449</guid><author>x_unknown</author><pubDate>Sun, 06 Aug 2017 20:09:13 +0800</pubDate><description><![CDATA[#include 
void fun( int n, int p1, int p2)
{
	int i;
	if(p1>p2)
	{
		int tmp;
		tmp=p2;
		p2=p1;
		p1=tmp;
	}
	for(i=p2;i>=p1;i--)
	{
		int tmp=0;
		tmp=(n>>(i-1))&1;
		if(tmp==1)
		{
			printf("1");]]></description><category></category></item><item><title><![CDATA[编写一个c函数,该函数给出一个字节中被置为1的位的个数]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76792081</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76792081</guid><author>x_unknown</author><pubDate>Sun, 06 Aug 2017 20:07:11 +0800</pubDate><description><![CDATA[#include 
int func(char ch)
{
	int i;
	int n=0;

	for(i=0;i<8;i++)
	{
		if((ch>>i)&1==1)
		{
			n++;
		}
	}
	return n;
}
int main()
{
	char ch;
	scanf("%c",&ch);
	int n = func(ch);
	printf("%d\n",n);]]></description><category></category></item><item><title><![CDATA[顺序队列]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76791092</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76791092</guid><author>x_unknown</author><pubDate>Sun, 06 Aug 2017 19:57:09 +0800</pubDate><description><![CDATA[#include 
#include "SqQueue.h"

int InitQueue (Queue *q)//创建队列
{
	if(q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	q->front = 0;
	q->rear  = 0;//初始队列没有元素
}

int QueueEmpty ( SeqQueue *q )//判断队列是否]]></description><category></category></item><item><title><![CDATA[链栈]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76790696</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76790696</guid><author>x_unknown</author><pubDate>Sun, 06 Aug 2017 19:52:37 +0800</pubDate><description><![CDATA[#include 
#include "LinkStack.h"

LinkStack *Creat_Stack ()//创建栈
{
	LinkStack *s = (LinkStack *)malloc(sizeof(LinkStack)/sizeof(char));
	
	s->top=NULL;
	
	return s;
}

int StackEmpty (LinkStack *S)//判]]></description><category></category></item><item><title><![CDATA[几种基本的排序方法]]></title><link>https://blog.youkuaiyun.com/x_unknown/article/details/76789879</link><guid>https://blog.youkuaiyun.com/x_unknown/article/details/76789879</guid><author>x_unknown</author><pubDate>Sun, 06 Aug 2017 19:33:57 +0800</pubDate><description><![CDATA[#include 

void mg(int *a, int left, int mid, int right, int *tmp)
{
	int i = left;
	int j = mid +1;
	int k = 0;
	while( i <= mid && j <= right)
	{
		if( a[i] < a[j] )
			tmp[k++] = a[i++];
		else]]></description><category></category></item></channel></rss>