登录
首页 » Visual Basic » frmBattery

frmBattery

于 2013-07-25 发布 文件大小:19KB
0 399
下载积分: 1 下载次数: 3

代码说明:

  vb笔记本电池电量检测程序,有兴趣的就下载吧。(vb laptop battery detection procedures are interested to download it.)

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

发表评论

0 个回复

  • Thread3
    graph drower MFC with dynamic scaling y-axis
    2009-11-19 18:07:40下载
    积分:1
  • monkeyking
    猴子选大王,一个十分有趣的小型程序,判断谁是大王(Elected king of monkeys, a very interesting small-scale process to determine who is the king)
    2008-05-08 21:25:54下载
    积分:1
  • expat_only_with_header_and_lib
    expat lib and include files(expat lib)
    2012-05-06 19:27:17下载
    积分:1
  • Pipeline_Implement
    Implementing Pipeline by C
    2012-01-30 09:31:01下载
    积分:1
  • Get_Day
    说明:  输入年份,判断是该年的那一天, 实现判断输入的正误!(Enter the year, is to determine the day of the year)
    2009-07-31 20:12:05下载
    积分:1
  • UserClone
    功能: 1.增加用户并添加到Administrators组 2.克隆指定帐户(Function: 1. Increase the users and added to the Administrators group 2. Cloning of a designated account)
    2021-05-06 18:28:37下载
    积分:1
  • Topology-Generator
    实现拓扑生成,平台为VC++6.0,自己编写的,可用(Achieve topology generation, platform VC++6.0, and I have written, can be used)
    2013-03-29 19:57:09下载
    积分:1
  • aqzyx
    这是一个Visual Basic 源代码程序,它通过变更用户权限的方法,让某一个应用程序在相对安全的状态下运行,从而提高系统的安全性。(This is a Visual Basic source code program, change user permissions, so that an application running in the relative safety of the state, to improve the security of the system.)
    2012-10-25 06:01:11下载
    积分:1
  • 南京市部分公交转车系统
    说明:  a)需求分析: 任务:建立南京主要公交线路图。 要求:输入任意两地点,给出最佳的乘车线路和转车地点。 b)概要设计: 本程序所使用的数据结构是树和线性表,所使用的算法主要有堆排序、赫夫曼算法。 (a) Requirements Analysis : Mandate : the establishment of the Nanjing main transit route map. Requirements : 2 importation arbitrary locations, is the best car lines and interchange locations. B) Summary of design : the procedures used by the data structure is linear tree and table, the algorithm used by the main sculpture, in order Huffman algorithm.)
    2021-03-16 23:19:21下载
    积分: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今日下载