搜索资源列表
leijiaqi
- 从000000000到11111111其中步进为K（随便设，）逐步增加，每遇到上升沿时进行增加-One step from 000,000,000 to 11,111,111 for the K (casual set,) and gradually increased to increase when the rising edge of each encounter
ORACLPUNIX-FAQ
- Oracle和Unix的相关文档,详细说明了日常使用当中会碰到的问题-Oracle and Unix-related document, detailing the daily use of them will encounter problems
BCDialogMenu
- BCmenu 自绘菜单，VC++源代码编程，自绘菜单实用性比较强，因为菜单的图标会有各种情况，如果你学会了用“自绘”的方式制作编写菜单，那么遇到什么难搞的修饰情况，你都不用怕了，自绘的手段有很多，本款只不过是其中之一，有兴趣的参考一下吧。 -BCmenu drawn from the menu, VC++ source code programming, from drawing a stronger utility menu because the menu icons have a va
KSQX
- VC++递归法实现简单分形图形示例程序，比如扣氏曲线类定义等。大家在C/C++学习时都会遇到递归，课本上以汗诺塔为例进行讲解，然后大家都希望自己找到一个递归的实例。本代码以一个最简单的分形图形来示范递归的实现过程。 -VC++ recursion simple example of fractal graphics program, such as Button' s definition of curve classes. Everyone in the C/C++ will enc
Passware_50_offkey
- 经常会遇到加密的access数据库，改程序能解密access数据库密码。-Often encounter encrypted access the database, change the program can decrypt access database password.
j2ee_Ebook_CHN
- J2EE指南对于广大的Java程序员来说是一份不可或缺的资料了。这篇导论对于初次碰到J2EE的程序员来说有着同样的作用。它与Java指南一样都是一例子为中心。-J2EE Java programmers guide for the majority of the information is an essential for the. Introduction For the first encounter of this J2EE programmers have the same effec
help-manual
- 包含jquery codesmith css javascr ipt 等chm格式的帮助文档，为你在开发地时候遇到一些小问题提供最全面的帮助-Jquery codesmith css javascr ipt include such as chm help file format, when you encounter in the development of small problems to provide the most comprehensive help
JAVAcllection
- 在使用Java的时候，我们都会遇到使用集合（Collection）的时候，但是Java API提供了多种集合的实现，我在使用和面试的时候频频遇到这样的“抉择” 。 :）（主要还是面试的时候）久而久之，也就有了一点点的心得体会，写出来以供大家讨论 。-In the use of Java, we would encounter with a collection (Collection) of the time, but a collection of Java API provides a va
embedC
- 面试嵌入式C语言的精华部分，包含面试中遇到的一些C语言基础问题-The essence of the interview part of the embedded C language, including some of the interview encounter problems C language based
wanpass
- 网管必须掌握破解密码.txt,网管员在维护和使用电脑时，经常会遇到各种密码丢失的问题，这里，我们就为广大网管员准备了一些破解密码的方法-Network must master to crack the code. Txt, network administrators in the maintenance and use of computers, we often encounter a variety of password loss, here, we prepared for the m
C-cal
- 在撰写程式时，也许会遇到算法的问题，这时参考一下C语言算法速查手册，希望能有帮助，-Writing program, the algorithm may encounter problems, then refer to C language algorithms Quick Reference, hoping to help,
thinking-in-CPP
- Like any human language, C++ provides a wa concepts. If successful, this medium of expres significantly easier and more flexible than the problems grow larger and more complex.-You can’t just look at C++ as a collection of features some of the
Dictionary-of-Networking
- Networks are currently one of the fastest growing and most important developments in the computer industry. Not only are more and more PCs becoming parts of networks, but networked PCs are being incorporated into larger enterprise-wide applicat
Java-package-to-jar
- java 打包方法，这篇内容部分来自官网及维基的翻译，大部分的代码都亲自做了测试，如果遇到问题可以联系我-java packaging method, this part of the content from the official website and wiki translation, most of the code to do the test yourself, if you encounter problems you can contact me
jibencaozuo
- 这是运用matlab进行图像处理时会遇到的基本操作，包括图像的代数运算、几何运算、空间变换、区域操作等-This is for image processing using matlab will encounter the basic operations, including images of algebra, geometry operations, space transformation, regional operations, etc.
Shopxp
- Shopxp是一个经过完善设计的经典网上购物系统，适用于各种服务器环境的高效网上购物系统解决方案，shopxp购物系统是我们首次推出的免费购物系统源码，完整可用。我们的系统是免费的不需要购买，该系统经过全面测试完整可用。如果碰到问题，先检查一下本地的配置或到官方网站提交问题求助。-Shopxp is a perfection of the classic online shopping system designed for a variety of server environments an
C-traps-and-defects
- C陷阱与缺陷 本书从语法分析、语法语义、连接、库函数、预处理器、可移植性缺陷等几个方面分析了C编程中可能遇到的问题。 -C traps and defects in the book from the syntax analysis, semantic, connection, library function, preprocessor, portability, and other aspects of defect analysis of the C programming may
assemble
- 装箱问题是大家经常碰到的问题，也有很多解决方法，这里使用近似算法解决。-Packing problem is that we often encounter the problem, there are many solutions, approximation algorithm is used here to solve.
msort
- 中介数排序是数学上的经典问题，在数据结构里也是大家经常碰到的问题，这里很好的解决了这个问题。-Intermediate number of sorting is a classic mathematical problems in the data structure is the problem we often encounter, where a good solution to this problem.
doudizhu
- 斗地主源代码,绝对能通过的源码,有可执行文件 根据斗地主出牌规则.对玩家出的牌进行检验.判断是否符合出牌规则. (关于斗地主的出牌规则网上有很多) 思路:将玩家的牌按升序排序.然后将牌进行拆分,分存在4个数组中.拆分规则如下: 假设有牌:333\444\555\789 则拆分后数组中的数据如下 arr[0]:345789 arr[1]:345 arr[2]:345 arr[3]:null 可以看出拆分规则是:如果遇到相同数字的牌则存