-
121231
gis系统开发公司的笔试题目，俩道简单的编程题目，要求用C++实现(gis system development company written questions, both simple programming channel topic requires C++ achieve)
- 2013-07-18 15:31:10下载
- 积分：1
-
AACDecTest
描述如何将AAC转换成PCM文件，很实用，也很基础，所以分享(it is a process about how to convert a aac file to a pcm file. it is my codes.)
- 2011-11-04 13:00:02下载
- 积分：1
-
SPEI
SPEI计算SPEI的R语言版与可执行版（含下载网址）.rar(SPEI calculated SPEI R-language version of the executable version (with download link). Rar)
- 2020-10-17 14:37:27下载
- 积分：1
-
easyshell
不错的后门代码，用了一些驱动技术来隐藏进程，隐藏注册表，希望对大家有所帮助(good backdoor code, used some technology-driven process to conceal, hide the registry, and I hope to help everyone)
- 2007-04-16 03:55:07下载
- 积分：1
-
MyTest_UI
通过网络编程采集数据并实时在界面上显示，集成了自己编写的类。(Through data collection and real-time network programming displayed on the interface that integrates their preparation classes.)
- 2013-07-27 21:42:15下载
- 积分：1
-
MyContour
用c#编写的生成矩形网格，内插等值点，绘制等值线。(Written in c# generate rectangular grid, equivalent point interpolation to draw the contour.)
- 2021-04-14 10:48:55下载
- 积分：1
-
Teach-Yourself-DirectX-7-in-24-Hours
Teach Yourself DirectX 7 in 24 Hours E-book
- 2012-09-06 21:14:28下载
- 积分：1
-
serial
很好的串口通信源程序，可以设置端口号，波特率，数据位 停止位校验位(a very complete source serial communications,it is helpful for everybody)
- 2009-05-22 10:47:15下载
- 积分：1
-
Sy7
编程实现一个静态切分为左右两个窗口的 MDI 应用程序，并在左视图中统计右视图中
绘制圆的个数,实现文件的保存和读取；左右视图属于不同的视图类(Programming a static cut into about two MDI application window and draw a circle in the right view statistics of the number in the left view, save and read files to achieve views are different views about the class)
- 2013-12-31 21:36:25下载
- 积分：1
-
UVALive4849
uvalive4849的ac源码。算法：2-sat。题意：给n（n<=3000）个黑方块的坐标，保证黑方块没有公共边。对于每个黑方块选一个角作为结点，使得所选结点满足输入的一个无向图。其中距离为曼哈顿距离。输出是否有解。possible或impossible。(AC source of uvalive 4849. Algorithms: 2-sat. Meaning of the questions: to n (n <= 3000) coordinates a black box, to ensure that there is no common edge black squares. For each black box to choose a corner as nodes, such that the selected nodes meet a directed graph with no input. Where the distance is the Manhattan distance. Output is solvable. possible or impossible.)
- 2015-01-25 21:27:51下载
- 积分：1
