获得硬盘信息的不错控件，来自www.torry.net
上传时间： 2014-01-02
上传用户：fandeshun
该文档是学习在Vxworks上进行编程开发的入门教材。
上传时间： 2013-12-20
上传用户：lhc9102
这是一个简单的java小程序，适合初学者参考学习，有一定的借鉴之处
上传时间： 2013-12-27
上传用户：thuyenvinh
CycloneII_NiosII的实验板资料，正在学习FPGA的可以参考一下
标签： CycloneII_NiosII 实验板
上传时间： 2013-12-22
上传用户：edisonfather
sin產生器，可以於VHDL產生sin之數值波形，進而輸出至dac做轉換
标签： sin
上传时间： 2013-12-25
上传用户：小儒尼尼奥
java书店管理系统 java书店管理系统 java书店管理系统
上传时间： 2014-01-01
上传用户：凌云御清风
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
标签： represented integers group items
上传时间： 2016-01-17
上传用户：jeffery
a simple process system lab task for hs2357
标签： process simple system 2357
上传时间： 2013-12-25
上传用户：zhangyigenius
2002年ACM Asia-BeiJing的比赛题目及原创算法解决方案：Radar Installation
标签： Asia-BeiJing Installation Radar 2002
上传时间： 2016-01-20
上传用户：黑漆漆
AD TO DA 转换程序，很好用经过测试
上传时间： 2016-01-20
上传用户：jiahao131
