Visual C++ source code for adding GPS units to PC desktop and Notebook exchange data from Serial port to GPS devices support for NMEA-0183 GPS Standard.
标签： Notebook exchange desktop Visual
上传时间： 2015-12-10
上传用户：大融融rr
java遍历8*8棋盘源代码 运用哈密顿回路遍历，速度很快
上传时间： 2015-12-10
上传用户：ls530720646
vc操作数据库中的数据,常采用的方式是ado+datagrid,datagrid在vs2003/2005环境中,资料很难找. 希望这份资料对用户有用.
上传时间： 2014-10-31
上传用户：bakdesec
使用java接收邮件，在DOS命令窗口中可直接编译运行该程序！
上传时间： 2014-10-28
上传用户：410805624
钱能的经典入门教程《C＋＋程序设计教程》书中例程的代码
上传时间： 2013-12-23
上传用户：shinesyh
fdsa fdsa fds a fds aafdsafd fdsa fdsa
上传时间： 2014-08-01
上传用户：exxxds
电子琴,从键盘接收字符,不回显,若为ESC键,则转EXIT,放音
上传时间： 2016-01-10
上传用户：stampede
通过可执行文件中的菜单“绘图”，可绘出直线、矩形、圆和圆弧等几种图形
上传时间： 2016-01-10
上传用户：tyler
语音信号处理方面比较全的一本书，许多算法对其他领域研究也有用
上传时间： 2014-01-10
上传用户：gyq
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
