<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ck0816的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/ck0816</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; ck0816]]></copyright><item><title><![CDATA[windows安全技术]]></title><link>https://blog.csdn.net/ck0816/article/details/86499826</link><guid>https://blog.csdn.net/ck0816/article/details/86499826</guid><author>ck0816</author><pubDate>Tue, 15 Jan 2019 22:22:28 +0800</pubDate><description><![CDATA[ 
			XP
			2003
			Vista
			2008
			Win 7
		GS
			 
			 
			 
			 
			 
		安全 C ookies
			√
			√
			√
			√
			√
		变量重排
			√
			√
			√
			√
			√
		安全 S.E.H
			 
			 
			 
			 
			 
		S.E.H 句柄验证
			√
			...]]></description><category></category></item><item><title><![CDATA[NYOJ 次方求模]]></title><link>https://blog.csdn.net/ck0816/article/details/61208158</link><guid>https://blog.csdn.net/ck0816/article/details/61208158</guid><author>ck0816</author><pubDate>Fri, 10 Mar 2017 21:03:04 +0800</pubDate><description><![CDATA[描述

求a的b次方对c取余的值

 

输入

第一行输入一个整数n表示测试数据的组数（n&amp;lt;100）
每组测试只有一行，其中有三个正整数a,b,c(1=&amp;lt;a,b,c&amp;lt;=1000000000)

输出

输出a的b次方对c取余之后的结果

样例输入


3
2 3 5
3 100 10
11 12345 12345

样例输出


3
1


10481

 


#includ...]]></description><category></category></item><item><title><![CDATA[数据结构-图的广度优先遍历(BFS)]]></title><link>https://blog.csdn.net/ck0816/article/details/60467299</link><guid>https://blog.csdn.net/ck0816/article/details/60467299</guid><author>ck0816</author><pubDate>Sun, 05 Mar 2017 15:00:13 +0800</pubDate><description><![CDATA[
#include &amp;lt;stdio.h&amp;gt;

#define MAX 6

//使用邻接矩阵 
int matrix[MAX][MAX];  

//图的广度优先遍历 
void BFS(int start) {
	int queue[MAX] = {0};
	int visited[MAX] = {0};  //优先队列 
	int head = 0;
	int tail = 0;
	i...]]></description><category></category></item><item><title><![CDATA[数据结构-图的深度优先遍历(DFS)]]></title><link>https://blog.csdn.net/ck0816/article/details/60467281</link><guid>https://blog.csdn.net/ck0816/article/details/60467281</guid><author>ck0816</author><pubDate>Sun, 05 Mar 2017 14:58:55 +0800</pubDate><description><![CDATA[
#include &amp;lt;stdio.h&amp;gt;

#define MAX 6
//邻接矩阵 
int matrix[MAX][MAX];

//图的深度优先遍历 
void DFS(int s) {
	int stack[MAX] = {0};  //栈 
	int visited[MAX] = {0};

	int top = 0, down = 0;  //栈顶和栈底

	stack[to...]]></description><category></category></item><item><title><![CDATA[lanqiao-矩阵乘法]]></title><link>https://blog.csdn.net/ck0816/article/details/60323624</link><guid>https://blog.csdn.net/ck0816/article/details/60323624</guid><author>ck0816</author><pubDate>Sat, 04 Mar 2017 11:58:56 +0800</pubDate><description><![CDATA[
问题描述
　　输入两个矩阵，分别是m*s，s*n大小。输出两个矩阵相乘的结果。
输入格式
　　第一行，空格隔开的三个正整数m,s,n（均不超过200）。
　　接下来m行，每行s个空格隔开的整数，表示矩阵A（i，j）。
　　接下来s行，每行n个空格隔开的整数，表示矩阵B（i，j）。
输出格式
　　m行，每行n个空格隔开的整数，输出相乘後的矩阵C（i，j）的值。
样例输入
2 3 2
1 0 -1
...]]></description><category></category></item><item><title><![CDATA[sunday模式匹配算法]]></title><link>https://blog.csdn.net/ck0816/article/details/60106342</link><guid>https://blog.csdn.net/ck0816/article/details/60106342</guid><author>ck0816</author><pubDate>Fri, 03 Mar 2017 09:05:11 +0800</pubDate><description><![CDATA[
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;string.h&amp;gt;

//sunday模式匹配算法
void initOcc(char* T, int* occ, int occn) {
	int i;

	for (i = occn - 1; i &amp;gt;= 0; i--) {
		occ[i] = -1;
	}

	for (i = strlen(T) - ...]]></description><category></category></item><item><title><![CDATA[在1到N个自然数中任取M个数的所有组合]]></title><link>https://blog.csdn.net/ck0816/article/details/57094547</link><guid>https://blog.csdn.net/ck0816/article/details/57094547</guid><author>ck0816</author><pubDate>Sat, 25 Feb 2017 19:23:08 +0800</pubDate><description><![CDATA[
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;malloc.h&amp;gt;
#include &amp;lt;string.h&amp;gt;

#define MAX 10
//在N个数中取M个数的组合， 所有可能列出来
//利用栈结构输出组合的所有可能

typedef struct stack {
	int arr[MAX];
	int top;  //栈顶指针
	int bot...]]></description><category></category></item><item><title><![CDATA[二叉排序树]]></title><link>https://blog.csdn.net/ck0816/article/details/56677311</link><guid>https://blog.csdn.net/ck0816/article/details/56677311</guid><author>ck0816</author><pubDate>Thu, 23 Feb 2017 17:59:01 +0800</pubDate><description><![CDATA[
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;malloc.h&amp;gt;

//排序二叉树
typedef struct node {
	int num;
	node* left;
	node* right;
} NODE;

//创建节点
NODE* create_node(int num) {
	NODE* n = (NODE*) malloc(sizeof(NO...]]></description><category></category></item><item><title><![CDATA[折半查找]]></title><link>https://blog.csdn.net/ck0816/article/details/56497442</link><guid>https://blog.csdn.net/ck0816/article/details/56497442</guid><author>ck0816</author><pubDate>Wed, 22 Feb 2017 21:07:40 +0800</pubDate><description><![CDATA[
# include &amp;lt;stdio.h&amp;gt;

int Binary_Search(int* arr, int n, int key) {
	int low, high, mid;
	low = 0;
	high = n - 1;
	while (low &amp;lt;= high) {
		mid = (low + high) / 2;  //折半
		if (key &amp;lt; arr[mid...]]></description><category></category></item><item><title><![CDATA[队列的链式存储结构]]></title><link>https://blog.csdn.net/ck0816/article/details/54943707</link><guid>https://blog.csdn.net/ck0816/article/details/54943707</guid><author>ck0816</author><pubDate>Thu, 09 Feb 2017 09:28:56 +0800</pubDate><description><![CDATA[#include 
#include 

typedef int sElemType;

typedef struct node {
	sElemType e;
	node* next;
} NODE;

typedef struct queue {
	int lenght;
	NODE* front;
	NODE* rear;
} queue;

NODE* create_node(sElemT]]></description><category></category></item><item><title><![CDATA[循环队列]]></title><link>https://blog.csdn.net/ck0816/article/details/54942897</link><guid>https://blog.csdn.net/ck0816/article/details/54942897</guid><author>ck0816</author><pubDate>Thu, 09 Feb 2017 08:12:28 +0800</pubDate><description><![CDATA[#include 
#include 
//循环队列 
#define MAXSIZE 10

typedef int sElemType;
typedef struct queue{
	sElemType data[MAXSIZE];
	int front;
	int rear;
}queue; 

void init_queue(queue* q) {
    q->front = 0;
  ]]></description><category></category></item><item><title><![CDATA[栈的链式存储结构]]></title><link>https://blog.csdn.net/ck0816/article/details/54910061</link><guid>https://blog.csdn.net/ck0816/article/details/54910061</guid><author>ck0816</author><pubDate>Tue, 07 Feb 2017 15:09:31 +0800</pubDate><description><![CDATA[
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;malloc.h&amp;gt;

typedef int sElemType;

typedef struct stackNode {
	sElemType e;
	stackNode* next;
} StackNode;

typedef struct linkStack {
	StackNode* top;
	int c...]]></description><category></category></item><item><title><![CDATA[两栈共享空间]]></title><link>https://blog.csdn.net/ck0816/article/details/54907926</link><guid>https://blog.csdn.net/ck0816/article/details/54907926</guid><author>ck0816</author><pubDate>Tue, 07 Feb 2017 11:25:00 +0800</pubDate><description><![CDATA[
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;malloc.h&amp;gt;
#include &amp;lt;stdio.h&amp;gt;
#define MAXSIZE 10
#define ERROR false
#define OK true

typedef int sElemType;

typedef struct {
	sElemType data[MAXSIZE];
...]]></description><category></category></item><item><title><![CDATA[栈]]></title><link>https://blog.csdn.net/ck0816/article/details/54907419</link><guid>https://blog.csdn.net/ck0816/article/details/54907419</guid><author>ck0816</author><pubDate>Tue, 07 Feb 2017 10:55:00 +0800</pubDate><description><![CDATA[
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;malloc.h&amp;gt;

#define ERROR false
#define OK true
#define MAXSIZE 5

typedef int sElemType;

typedef struct {
	sElemType data[MAXSIZE];
	int top;
} sqStack;

//压...]]></description><category></category></item><item><title><![CDATA[双向链表]]></title><link>https://blog.csdn.net/ck0816/article/details/54892470</link><guid>https://blog.csdn.net/ck0816/article/details/54892470</guid><author>ck0816</author><pubDate>Mon, 06 Feb 2017 14:17:15 +0800</pubDate><description><![CDATA[
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;malloc.h&amp;gt;

//双向链表

typedef struct node {  //结点
	int num;
	node* prior;  /*前驱指针*/
	node* next;  /*后继指针*/
} NODE;

NODE* last = NULL;  //记录上一个结点指针 

/**
    创建一...]]></description><category></category></item><item><title><![CDATA[循环链表]]></title><link>https://blog.csdn.net/ck0816/article/details/54879792</link><guid>https://blog.csdn.net/ck0816/article/details/54879792</guid><author>ck0816</author><pubDate>Sun, 05 Feb 2017 09:58:01 +0800</pubDate><description><![CDATA[
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;malloc.h&amp;gt;
//循环链表 
typedef struct node {
	int num;
	node* next;
} NODE;

NODE* fool;//尾结点 
int lenght = -1;//链表的长度 

NODE* create_node(int num) {
	NODE* n = (N...]]></description><category></category></item><item><title><![CDATA[单向链表 增 删 改 查]]></title><link>https://blog.csdn.net/ck0816/article/details/54864549</link><guid>https://blog.csdn.net/ck0816/article/details/54864549</guid><author>ck0816</author><pubDate>Sat, 04 Feb 2017 17:28:25 +0800</pubDate><description><![CDATA[
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;malloc.h&amp;gt;

typedef struct node {
	int num;
	node* next;
} NODE;

int lenght = -1;//线性表的链式结构的长度

/*
    创建节点 
*/
NODE* create_node(int num) {
	NODE* n = (NODE*...]]></description><category></category></item><item><title><![CDATA[NYOJ 快速查找素数]]></title><link>https://blog.csdn.net/ck0816/article/details/54728432</link><guid>https://blog.csdn.net/ck0816/article/details/54728432</guid><author>ck0816</author><pubDate>Wed, 25 Jan 2017 09:38:35 +0800</pubDate><description><![CDATA[时间限制：1000ms | 内存限制：65535KB

难度：3

描述

现在给你一个正整数N，要你快速的找出在2.....N这些数里面所有的素数。

输入

给出一个正整数数N(N&amp;lt;=2000000)
但N为0时结束程序。
测试数据不超过100组

输出

将2~N范围内所有的素数输出。两个数之间用空格隔开

样例输入


5
10
11
0

样例输出


2 3 5
2 3 ...]]></description><category></category></item><item><title><![CDATA[十进制转化为八进制]]></title><link>https://blog.csdn.net/ck0816/article/details/50824224</link><guid>https://blog.csdn.net/ck0816/article/details/50824224</guid><author>ck0816</author><pubDate>Tue, 08 Mar 2016 07:33:26 +0800</pubDate><description><![CDATA[ 
	编写函数，其功能为把一个十进制数转换为其对应的八进制数。程序读入一个十进制数，调用该函数实现数制转换后，输出对应的八进制数。
	 
	 
	 样例输入
	 9274
	 样例输出
	 22072
	样例输入
	 18
	 样例输出
	 22
	
# include &amp;lt;stdio.h&amp;gt;

int f(int a) {
    if (a == 0) {
        return...]]></description><category></category></item></channel></rss>