登录
首页 » Visual Basic » 54678976543

54678976543

于 2013-08-30 发布 文件大小:2KB
0 319
下载积分: 1 下载次数: 1

代码说明:

  简单的鼠标画线Vb源代码,有需要的就下载吧。(Simple mouse to draw lines Vb source code, there is a need to download it.)

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

发表评论

0 个回复

  • list
    链表的基本功能实现链表的各种基本功能,初学者使用(The basic functions of the list)
    2011-06-01 21:07:30下载
    积分:1
  • BookManager
    说明:  用VB 6.0 + SQL Server2000 编译写的图馆管理系统(Using VB 6.0 SQL Server2000 compiler written by library management system)
    2008-11-04 19:30:38下载
    积分:1
  • CSharp
    计算器最简单的功能能调用winxp计算器(The simplest function calculator)
    2011-06-23 15:43:20下载
    积分:1
  • computer_design
    该程序能够实现计算器程序设计,采用C++编程,来自C++程序设计原理与实践。(The program can achieve calculator program design, using C++ programming, program design from C++ Principles and Practice)
    2014-02-19 14:34:59下载
    积分:1
  • caculator_basedon_dialog
    我自己写的一个基于对话框的计算器,很有参考价值。(I wrote a dialog on the calculators, great reference value.)
    2007-01-07 15:55:22下载
    积分:1
  • EX_Dictionary
    能对已有的单词数据库进行查询,修改,实现双向翻译,并能够进行模糊查询(Word on the existing database can be queried, modified, two-way translation, and be able to carry out fuzzy query)
    2013-10-10 20:31:55下载
    积分:1
  • closest_pair
    分治法思想,求最邻近点对,考虑将所给的n个点的集合S分成2个子集S1和S2,每个子集中约有n/2个点,然后在每个子集中递归地求其最接近的点对(Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its focus in each sub-the closest point)
    2013-12-07 16:46:26下载
    积分:1
  • VC_GWVI_Code
    说明:  vc编写的虚拟仪器的例子 带有信号显示的方法(vc The virtual instrument with a signal example of the methods shown)
    2010-04-06 12:31:29下载
    积分:1
  • 73554574
    VB语音报数计算器源程序,有需要的就下载吧。(Talking Calculator VB source code, there is a need to download it.)
    2013-08-04 15:26:48下载
    积分:1
  • closest_pair
    分治法思想,求最邻近点对,考虑将所给的n个点的集合S分成2个子集S1和S2,每个子集中约有n/2个点,然后在每个子集中递归地求其最接近的点对(Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its focus in each sub-the closest point)
    2013-12-07 16:46:26下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载