登录
首页 » pascal » usb 检测

usb 检测

于 2022-01-26 发布 文件大小:1.13 kB
0 166
下载积分: 2 下载次数: 1

代码说明:

这是一个工具库的启用和禁用hfjafafjkda

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

发表评论


0 个回复

  • TJU1127
    同济大学ACM题库TJU1127的题解代码.(TJU1127 Tongji University ACM questions in the code that solution.)
    2007-03-02 23:18:46下载
    积分:1
  • ScriptEditor_v1.6.2
    编写恰年脚本的控件。内附说明,有具体的脚本命令(1000y server vbs tools)
    2010-11-03 14:34:08下载
    积分:1
  • [349-2016-QD-TGD]972016111801AM
    月1日 - 说明: 主要用于C#开发客户端,用于读写西门(hi every bodyertgeghrgb)
    2019-01-10 11:34:50下载
    积分:1
  • 全志H5主板
    说明:  PADS软件打开,一个DDR,需要的可以下载参考(PADS software open, a DDR, you need to download reference)
    2020-06-30 11:40:02下载
    积分:1
  • xds
    线段树的Pascal(神奇手链)源代码,可供noip、noi、acm等选手学习用(Pascal segment tree (magical bracelet) source code, available noip, noi to acm and other players to learn from)
    2012-06-08 12:10:10下载
    积分:1
  • FreeKaoYanDS_pascal
    数据结构课件 电子科技大学个人认为比严蔚敏、张铭的视频好 (data structure Courseware University of Electronic Science and Technology)
    2010-11-20 20:20:56下载
    积分:1
  • dangcing-links
    dangcing links
    2011-03-03 16:30:01下载
    积分:1
  • CHAPTER5
    pid自适应控制器学习和程序大家学习,很好用的(点对点)
    2010-09-17 10:55:03下载
    积分:1
  • Bone-Sort(ZJU1440)
    浙大ACM1440 Bone Sort WishingBone有许多骨分拣机,可以执行如下的功能: 有一天,他偶然发现他可以使用几个这样的骨分拣兴建超级骨分拣。例如,下面的数字说明了一个方法来建构水平的4超级骨分拣六个骨分拣机,可以进行排序4个任意数字。 但是,作为一个小狗,他是骨头确保节俭。于是,他想知道什么骨分拣机的数量最少可以构建一个n-超骨分拣。此外,他并不真正需要的一般的分拣,但他事先知道一些数字,这样你就可以采取这种优势,在计算解决方案。 (假设骨分拣机可以放在任何对线)。 顺便说一下,他也急切地想知道原号码的反演。 (他希望这个值来评价他的骨头分拣效率。)数反转(AI,AJ)等对满足我<j和Ai> AJ的。(WishingBone has many bone sorters that can perform function as follows: One day he happened to find out he could use several such bone sorters to construct super bone sorters. For instance, the figure below illustrates one way to construct a level 4 super bone sorter with six bone sorters, which can sort 4 arbitrary numbers. But, as a doggie, he is sure thrift on bones. So he wonders what the minimal number of bone sorters to construct an n-super bone sorter could be. Besides, he does not actually need a general sorter, but one on some numbers he knows in advance, so that you may take this advantage in calculating the solution. (Suppose bone sorter can be placed on any pair of lines.) By the way, he is also eager to know the inversion number of the original numbers. (He wants this value to evaluate the efficiency of his bone sorter.) Inversion number is the number of such pairs (Ai, Aj) that satisfies i<j and Ai>Aj.)
    2012-05-25 21:31:38下载
    积分:1
  • fpLCLSimple_3.2526
    Simple Lazarus Chromium Browser
    2018-11-19 23:02:58下载
    积分:1
  • 696518资源总数
  • 104517会员总数
  • 39今日下载