登录
首页 » Visual C++ » MP10Setup_21hulian

MP10Setup_21hulian

于 2008-04-16 发布 文件大小:12459KB
0 125
下载积分: 1 下载次数: 1

代码说明:

  挺 有用的一些资料,希望能和大家一起共享。(Quite a number of information used in the hope of sharing with everyone.)

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

发表评论

0 个回复

  • eluosi
    用c++编写的俄罗斯方块小游戏,有兴趣的可以学习下(With c++ Tetris game, interested can learn under)
    2013-10-15 22:11:42下载
    积分:1
  • 脚本破解
    适合用于破解石器时代脚本密码,查看ASSA密码,STW密码等(Stone Age ASSA script password cracking artifact)
    2020-06-20 02:00:01下载
    积分:1
  • lect16-Stereo-and-3D-Vision
    立体视觉方面的介绍和推导PPT,有助于初学者理解掌握多视几何(Introduction and derivation of three-dimensional visual PPT, help beginners understand the multi view geometry)
    2017-04-15 14:56:46下载
    积分:1
  • e
    基于c++编程的俄罗斯方块源程序代码 请多多支持 (Please support Tetris based c++ programming source code)
    2013-05-13 20:44:12下载
    积分:1
  • Shape trader
    Run the patch, and then use the software. Even though the software display is not registered, all functions and time limits have been broken
    2018-08-09 21:26:53下载
    积分:1
  • viterbi
    自己编写的viterbi译码算法,为课堂作业。比较简单易懂。(I have written viterbi decoding algorithm for classroom operation. Relatively simple to understand.)
    2020-10-20 11:17:25下载
    积分:1
  • alarm
    一个定时提醒的程序,可以任意设置定时时间,有皮肤,带有最小化到通知栏,抖动及声音提醒,提醒时窗口置顶等功能。(A timed reminder program that can be set regular time, have skin with minimized to the notification bar, jitter and voice reminder, reminder window when the top and other functions.)
    2014-02-05 19:52:18下载
    积分:1
  • unit-8
    谭浩强C程序设计第四版第8章习题答案,自己做出来的( C Programming Fourth Edition Chapter 8 Exercise answers, do it yourself)
    2013-07-31 22:16:17下载
    积分: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
  • Unikey-4.0
    to study for student
    2013-08-28 12:11:13下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 42今日下载