登录
首页 » Visual Basic » 4675465764

4675465764

于 2013-08-22 发布 文件大小:5KB
0 230
下载积分: 1 下载次数: 3

代码说明:

  VB将数据库导出到TXT文本文件中,有需要的就下载吧。(VB database export to TXT text file, there is a need to download it.)

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

发表评论


0 个回复

  • 54678976543
    简单的鼠标画线Vb源代码,有需要的就下载吧。(Simple mouse to draw lines Vb source code, there is a need to download it.)
    2013-08-30 09:19:35下载
    积分:1
  • VC_GWVI_Code
    说明:  vc编写的虚拟仪器的例子 带有信号显示的方法(vc The virtual instrument with a signal example of the methods shown)
    2010-04-06 12:31:29下载
    积分:1
  • caculator_basedon_dialog
    我自己写的一个基于对话框的计算器,很有参考价值。(I wrote a dialog on the calculators, great reference value.)
    2007-01-07 15:55:22下载
    积分:1
  • debuglib
    vc调试模式下运行程序常用的动态库,希望给一些朋友帮助,特收集起来共享.(vc debug mode used to run programs under the dynamic library, hoping to help give some of my friends, to share special collected.)
    2009-03-31 09:38:04下载
    积分:1
  • abc
    简单易行,很好玩很简单那,我都没费什么功夫(Simple and fun it is very simple)
    2010-11-24 16:04:20下载
    积分:1
  • 07136288
    说明:  本程序是使用 TURBO C 语言BOSS窗口开发程序库的应用程序,(This program is the use of TURBO C language BOSS window development program library application,)
    2018-12-31 10:43:56下载
    积分:1
  • ip
    ip从char[]转为int,ip地址转换( transform ip from char[] to int)
    2012-05-22 15:11:35下载
    积分:1
  • ski_way
    Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向 下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道在一 个区域中最长的滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。 (Michael likes to ski hundred This is not surprising, because the skiing is very stimulating indeed. However, in order to obtain speed, Waterloo regional must be downward-sloping, and when you slide into the base, you have to embark once again on the slope or to set you waiting for lifts. Michael would like to know the longest in a landslide area. Region is given by a two-dimensional array. Each figure represents an array of high points.)
    2008-08-25 11:19:18下载
    积分:1
  • EXCEL
    数据保存到EXCEL文件 给出了实例文件可以参考(EXCEL data files saved to the file is given instance can refer to)
    2009-04-26 22:59:20下载
    积分: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
  • 696518资源总数
  • 104569会员总数
  • 24今日下载