登录
首页 » Visual C++ » control2

control2

于 2013-07-01 发布 文件大小:10788KB
0 363
下载积分: 1 下载次数: 1

代码说明:

  这是一个在控制面板中增加自己软件所需配置属性的源程序。(This is an increase in the control panel software required for their configuration properties of the source.)

文件列表:

control2

........\ipch
........\....\testcpl-ad1d11e8
........\....\................\testcpl-db58f555.ipch,32178176,2012-06-22
........\resource.h,632,2007-05-14
........\testcpl.aps,33488,2007-06-22
........\testcpl.cpp,3948,2007-06-22
........\testcpl.def,39,2007-05-22
........\testcpl.dsp,4366,2007-05-23
........\testcpl.dsw,539,2007-05-13
........\testcpl.ncb,41984,2007-06-22
........\testcpl.opt,48640,2007-06-22
........\testcpl.plg,1354,2007-06-22
........\testcpl.rc,2657,2007-06-22
........\testcpl.sdf,23744512,2012-06-22
........\testcpl.suo,2560,2012-06-22
........\testcpl.vcxproj,7283,2012-06-22
........\testcpl.vcxproj.filters,1367,2012-06-22
........\testcpl.vcxproj.user,143,2012-06-22

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

发表评论

0 个回复

  • Desktop
    调度问题的回溯算法,算法中的经典问题。问题描述:假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度,使得完成全部任务的时间最早。(Scheduling problem backtracking algorithm is the classic problem. Problem Description: Suppose there are n-task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks.)
    2010-02-19 23:31:11下载
    积分:1
  • distance_between_two_lines
    对于给定的两个线段,程序输出这两个线段之间的距离(For a given two line segments, the program output that the distance between two line segments)
    2009-03-25 16:04:31下载
    积分:1
  • minroob
    console application mineswiper
    2013-03-04 06:01:55下载
    积分:1
  • KTL
    说明:  从专业设备上读取数据图像,并对其进行分析的代码。(from professional equipment to read data from images and analysis of its code.)
    2005-09-17 11:17:51下载
    积分:1
  • vgpicker
    说明:  在mfc单文档下的p程序 通过碰撞检测实现了模型的抓捕(Mfc Single Document in p under the collision detection procedure realize the model to capture)
    2008-09-25 15:54:50下载
    积分:1
  • template
    template 模版函数 函数模版 深入了解(template template template-depth understanding of the function function)
    2013-07-15 17:33:53下载
    积分:1
  • tvicport
    在WINDOWS 9X/NT下不通过WIN DDK而直接存取硬件的专用开发包,支持VISUAL C++和DELPHI/C++ BUILDER,需要32位编译器。TVicPort includes transparent support for Windows 95/98 and Windows NT (in Windows 9X/NT under WIN DDK is not passed directly access dedicated hardware development kits, support Visual C and Delphi/C BUILDER need 32 compiler. TVicPort includes transparent support for Windows 95/98 and Windows NT)
    2005-05-26 10:40:55下载
    积分:1
  • tongxinlu
    通信录源程序。调试环境为TC2.0或者3.0。运行这个程序需要tc提供的几个头文件。(Example source address book, or 3.0 debugging environment for TC2.0. Tc run the program needs to provide several header files. )
    2011-12-05 15:03:16下载
    积分:1
  • CNC-chabu
    实现两坐标运动控制,相当完美,看了这个代码,你也可以开发数控系统了(CNC CONTROL)
    2021-02-14 10:39:49下载
    积分: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
  • 696516资源总数
  • 106914会员总数
  • 0今日下载