登录
首页 » Others » cgoc231

cgoc231

于 2017-04-11 发布 文件大小:27KB
0 224
下载积分: 1 下载次数: 1

代码说明:

  By Riccardo Pareschi, 系统研究2 读大量的Windows环境信息,有文档及源代码,(By Riccardo Pareschi, 2 read a large amount of Windows environment information system research, documentation and source code,)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 1636827
    excel_automation excel automation的使用()
    2018-05-16 19:30:29下载
    积分:1
  • keyboard
    模拟键盘输入,对VC++的响应机制可以有更加全面的认识,对指令的熟悉又帮助。(Simulated keyboard input, on the response mechanism of VC++ can have a more comprehensive understanding of familiar instructions to help.)
    2010-05-13 16:43:47下载
    积分:1
  • Theprogrammingcontestworkscollection
    世界编程大赛作品收集绝对经典,值得一看!(Collected works of the world' s absolute classic programming contest, worth a visit!)
    2010-09-24 09:29:22下载
    积分:1
  • simple_web_browser
    source code for a very simple web browser!
    2009-03-18 08:03:24下载
    积分:1
  • kyngitudinal-debugger
    一个使用Delphi控制浏览器的例子,很不错的代码(An example of using Delphi to control a browser, good code)
    2018-10-28 16:11:47下载
    积分:1
  • Untitled
    economic dispatch with multiple constraints
    2010-02-22 23:28:37下载
    积分:1
  • computer
    计算器,实现一个式子的加减计算,多个式子的计算,并测试结果(Calculator, to achieve a statement holds for addition and subtraction, multiple statement holds calculations, and test results)
    2009-10-11 21:00:13下载
    积分:1
  • youxiangtu
    编写C程序,随机给出n*n的邻接矩阵,并打印输出邻接矩阵,以及有向图的边的个数,每个顶点的度,并判断该图中是否存在Euler回路: (1)如果为n阶,则随机产生一个n*n的邻接矩阵; (2)输出邻接矩阵,边的个数,每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点,一个是数据结构中的有向图的邻接矩阵的创建,还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)
    2008-06-14 02:33:57下载
    积分:1
  • 英文文本信息熵的计算
    说明:  实用C++计算一篇英文文本的信息熵 1、 读取文档,统计英文字母及空格出现的次数; (将小写字母转为大写字母进行计数) 2、 求概率分布P(X); 3、 根据定义求信息熵。(Computing the information entropy of an English text with C + + 1. Read the document and count the number of English letters and spaces; (convert lowercase letters to uppercase letters for counting) 2. Calculate the probability distribution P (x); 3. According to the definition of entropy.)
    2020-10-04 09:41:10下载
    积分:1
  • gh0st
    修改过的GH0ST界面和功能调整,增加启动FLASH(Revised GH0ST interface and functionality adjustments to increase the boot FLASH)
    2010-02-20 22:53:05下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载