登录
首页 » Visual C++ » GetXSL

GetXSL

于 2013-11-25 发布 文件大小:16041KB
0 230
下载积分: 1 下载次数: 6

代码说明:

  一个基于MFC操作excel表格的应用程序。根据需求生成一张刻度与数据对应的excel表(MFC-based operation excel spreadsheet application. Excel sheet with a scale corresponding to the data generated on demand)

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

发表评论

0 个回复

  • 屏幕保护序基类
    说明:  就是个屏幕保护程序基类,希望对大家能够有所帮助.(screens is the base class protection program, we hope to be able to help.)
    2005-11-14 13:24:12下载
    积分:1
  • Exceptional-cPP
    Exceptional c++中文版,指导c++程序员写出高效整洁的代码(Exceptional c++ Chinese version of the guide c++ programmers to write efficient code clean)
    2013-08-19 16:24:48下载
    积分:1
  • 04_ScrollBarDemo
    基于MFC的,用C++语言编写的一个程序界面 使得界面有滚动条功能(Scroll bar interface function MFC-based, a program written C++ language interface)
    2012-09-14 20:55:31下载
    积分:1
  • DVRPlayer
    说明:  一个VC写的程序,dvr播放器,希望对初学同学又所帮助,已编译通过,好用。(VC to write a program, dvr player, want to help beginner students they have been compiled by, easy to use.)
    2010-04-21 23:03:35下载
    积分:1
  • 2
    说明:  一段程序,基于图像处理的实现驾驶员疲劳判断 (A segment of a program, based on the image processing to achieve the fatigue of the driver judgment)
    2012-05-09 20:34:26下载
    积分:1
  • SharpNeatV2
    java file for tsp problem solution and neural network sample mode .diffrent techniques in neural network
    2010-10-07 12:57:31下载
    积分:1
  • HOUGH
    HOUGH变换圆检测,可同时检测多个圆;对了解HOUGH变换很有帮助(HOUGH transform circle detection, can simultaneously detect multiple round)
    2010-08-03 09:38:56下载
    积分:1
  • SOD88
    sod88是北京理工大学开发的一款光学设计软件,dos界面,但初学还是很有用的。(sod88,optical design)
    2015-09-18 12:26:30下载
    积分:1
  • Print1ToMaxOfNDigits
    输入一个十进制数字,打印出其二进制所包含的1的个数,空间复杂度很小(Enter a decimal number, print out its binary contains a number, a very small space complexity)
    2013-09-04 19:15:43下载
    积分:1
  • 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
  • 696516资源总数
  • 106914会员总数
  • 0今日下载