完整龙族的无错反外挂登陆器,b编译后直接直接就可以放在客户端下运行，记主要修改服务端验证程序和端口
上传时间： 2013-12-19
上传用户：onewq
大数的模运算。 a^b ％ m a可以为1000位的大数，b，m在int 范围内
上传时间： 2014-01-01
上传用户：heart520beat
Boost provides free peer-reviewed portable C++ source libraries. We emphasize libraries that work well with the C++ Standard Library. Boost libraries are intended to be widely useful, and usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. We aim to establish "existing practice" and provide reference implementations so that Boost libraries are suitable for eventual standardization. Ten Boost libraries are already included in the C++ Standards Committee s Library Technical Report (TR1) as a step toward becoming part of a future C++ Standard. More Boost libraries are proposed for the upcoming TR2. Boost works on almost any modern operating system, including UNIX and Windows variants. Follow the Getting Started Guide to download and install Boost. Popular Linux and Unix distributions such as Fedora, Debian, and NetBSD include pre-built Boost packages. Boost may also already be available on your organization s internal web server.
标签： libraries peer-reviewed emphasize provides
上传时间： 2016-12-05
上传用户：semi1981
超好用的C/C++编译器,在Source Insight3下程序可读性非常好，支持标准的C、C++,JAVA编程
上传时间： 2016-12-06
上传用户：qoovoop
Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
标签： Subsequence sequence Problem Longest
上传时间： 2016-12-08
上传用户：busterman
两台处理机A 和B处理n个作业。设第i个作业交给机器 A 处理时需要时间ai，若由机器B 来处理，则需要时间bi。由于各作 业的特点和机器的性能关系，很可能对于某些i，有ai >=bi，而对于 某些j，j!=i，有aj<bj。既不能将一个作业分开由两台机器处理，也没 有一台机器能同时处理2 个作业。设计一个动态规划算法，使得这两 台机器处理完成这n 个作业的时间最短（从任何一台机器开工到最后 一台机器停工的总时间）。研究一个实例：（a1,a2,a3,a4,a5,a6）= （2,5,7,10,5,2）；（b1,b2,b3,b4,b5,b6）=（3,8,4,11,3,4）
上传时间： 2014-01-14
上传用户：独孤求源
DS1302读写程序。功能：向串口调试工具输入b，窗口立刻显示从DS1302读出的时间值。用户只需更改管脚定义，即可在自己的板子上运行。该程序在STC12C5A56S2单片机上已通过硬件调试，晶振24M。
上传时间： 2016-12-14
上传用户：thuyenvinh
适合C++初学者的入门书籍。深入C++系列，中文版；Stanley B Lippman著；潘爱民 张丽译；中国电力出版社；内容分五篇，共20章，很全面。
上传时间： 2016-12-15
上传用户：天诚24
1.B树的实现 2.ElfHash的实现 3.三种排序方式(插入，归并，快速）
上传时间： 2013-12-29
上传用户：exxxds
功能：用斐波那契法求f(x)在区间[a,b]上的近似极小值。当且仅当f(x)在[a,b]上为单峰时次方法适用
标签：
上传时间： 2013-12-24
上传用户：csgcd001
