资源列表
MS08-067
- MS08067漏洞利用源代码,包括了主要攻击过程-Exploit of MS08067
test_quickSort.cpp
- 分段快速排序，详见输入实例。对不同段，分别进行无递归快速排序-segment quick sort
WindowServer
- 使用c语言实现winServer 功能。开发环境vs2010 系统win7 有问题可以加我qq 22366638-The use of C language to realize winServer function. VS2010 system development environment win7 problem can add my QQ 2236663899
APB_Problem
- POJ试题 A+B Q: Where are the input and the output? A: Your program shall always read input stdin (Standard Input) and write output to stdout (Standard Output). For example, you can use scanf in C or cin in C++ to read stdin, and use printf in C
Exponentiation
- Exponentiation Problems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems. This problem requires t
Eight-queen
- 八皇后问题，是一个古老而著名的问题，是回溯算法的典型案例。该问题是国际西洋棋棋手马克斯·贝瑟尔于1848年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法-Eight queens problem is an old and famous, is a typical case of backtracking algorithm The problem is the international chess player
3Sum
- 比较好的leetcode编程的代码答案，使用的是C++写的，可以具体见网站查看-The answer better leetcode programming code, using c++ written, you can see the web site to see
shuduyouxi
- 数独的游戏规则： 1、在9×9的大九宫格内，已给定若干数字，其他宫位留白，玩 家需要自己按照逻辑推敲出剩下的空格里是什么数字。 2、必须满足的条件：每一行与每一列都有1到9的数字，每个小 九宫格里也有1到9的数字，并且一个数字在每行、每列及每 个小九宫格里只能出现一次，既不能重复也不能少。 3、每个数独游戏都可根据给定的数字为线索，推算解答出来。 -Sudoku rules of the game: 1, in the 9 x 9 large squares, has
Gray_Binary_Image_Processing_in_C
- This program is used to convert a grayscale image into a binary image. The imput image should be of size 320x240, The grayscale image should be named inputGray . The image should be of BMP type. The output will be formed in outputimage1 file -This
agregation
- agregation. defines the entry point for the console application.
array_min
- 将一个数组合并一个数，并输出最小数，要考虑越界-An array of the merger of a number, and the minimum number of outputs, to consider cross-border
max_aera
- 内容相同且相连我们称为一个区域，找出最大的一块-Connected to the same content and we called a region, find the maximum of one