登录
首页 » Visual C++ » NeheChm

NeheChm

于 2009-06-08 发布 文件大小:2415KB
0 98
下载积分: 1 下载次数: 2

代码说明:

  通过这篇文章的学习可以学习到opengl的知识。(Through this article to learn can learn opengl knowledge.)

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

发表评论

0 个回复

  • Simple-word-Class
    简单的封装了对word的操作 使用 CComVariant vOpt(Simple word Class)
    2014-09-11 11:50:33下载
    积分:1
  • Menu
    使用VC++语言基本实现菜单栏的基本功能(VC++ language using the basic realization of the basic functions of the menu bar)
    2011-05-10 08:16:43下载
    积分:1
  • AVI
    光流法、帧间差分法、高斯背景模型差分法,在opencv环境下实现运动目标检测(moving objective detection matlab)
    2011-10-27 15:50:28下载
    积分:1
  • wannianli
    万年历的具体算法和实现过程,不错的奥,这是我的第一个完整的程序(Calendar of specific algorithms and implementation process, a good Austrian, this is my first full procedures)
    2008-01-07 17:37:37下载
    积分:1
  • MeansOfString
    c语言中字符串的处理,其中包含了各种针对字符串问题的处理方法以及库函数(c language string handling, which includes a variety of problems for string processing method and library functions)
    2013-08-31 08:57:26下载
    积分:1
  • T3DCHA~4
    游戏的声音图像演示程序,通过本程序的演示说明你可以清楚的了解游戏的声音图像(The voice of the game demo images, through the demonstration of this procedure to show that you can clearly understand the voice of the game image)
    2007-10-27 16:38:00下载
    积分:1
  • MicroSD
    简要介绍MicroSD卡和使用方法,希望对各位朋友有帮助(Simply discript how to use MicroSD)
    2014-09-02 01:44:19下载
    积分:1
  • QSGS
    采用四参数生成法自动生成多孔介质(二维),优化了出现独立单个节点、实体内部出现孔洞的问题(Four-parameter generation method automatically generates a porous medium, optimize the emergence of an independent single node, hole problems arise internal entities(2D))
    2021-04-22 15:38:48下载
    积分:1
  • medo
    设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组,每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n(n<=200),表示每个数组有n个数。接下来的两行分别是X,Y数组的元素。结果输出 程序运行结束时,将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)
    2021-03-22 16:29:16下载
    积分:1
  • kviso_wave
    单片机仿真软件 集成了源程序编辑、编译、调试、反 汇编等功能于一体。 可仿真MCS51系列、MCS196系列、 Microchip PIC系列CPU(SCM simulation software is integrated with the source program to edit, compile, debug, disassemble functions in one. Simulation of MCS51 series, MCS196, Microchip PIC series CPU)
    2017-09-30 08:39:57下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载