幾乎涵蓋了所有加密算法的源代碼3des，md5，rsa，sha……，還帶有測(cè)試SAMPLE，不可多得的好東西。
上傳時(shí)間： 2015-08-30
上傳用戶：Shaikh
英文版,pdf格式。 詳細(xì)說(shuō)明： Title: STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library (2nd Edition) URL: http://www.amazon.com/exec/obidos/tg/detail/-/0201379236/ ISBN: 0201379236 Author: David R. Musser / Gillmer J. Derge / Atul Saini / Gilmer J. Derge Publisher: Addison-Wesley Page: 560 Edition: 2nd edition (March 27, 2001) Catalog: C++ Format: PDF Size: 3.8M Supplier: December Summary: The Standard Template Library was created as the first library of genetic algorithms and data structures, with four ideas in mind: generic programming, abstractness without loss of efficiency, the Von Neumann computation model, and value semantics. This guide provides a tutorial, a description of each element of the library, and SAMPLE applications. The expanded second edition includes new code examples and demonstrations of the use of STL in real-world C++ software development it reflects changes made to STL for the final ANSI/ISO C++ language standard.
標(biāo)簽： Programming Reference Standard Tutorial
上傳時(shí)間： 2015-09-02
上傳用戶：Breathe0125
This code in this directory implements the binary hopfield network. Source code may be found in HOPNET.CPP. A SAMPLE training file is H7x8N4.trn. SAMPLE test pattern files are: H7x8D4.TST, H5x8D7.TST, H5x8D7.TST and H5x8D9.TST, Output of the program goes to both the screen and a file, ARCHIVE.LST.
標(biāo)簽： code implements directory hopfield
上傳時(shí)間： 2014-01-16
上傳用戶：123啊
數(shù)據(jù)庫(kù)封裝原代碼 1. 該代碼可以免費(fèi)使用, 該代碼的名字暫時(shí)定為\"哲別\" 2. 如果你需要使用該代碼, 請(qǐng)注明該代碼的原來(lái)作者: Jacky Zhou 3. 如果你發(fā)現(xiàn)該代碼有bug,可以自己修改或者請(qǐng)給我發(fā)email: zyx040404@163.com 4. 該數(shù)據(jù)庫(kù)封裝代碼功能可以對(duì)數(shù)據(jù)庫(kù)的表,視圖和存儲(chǔ)過(guò)程進(jìn)行封裝,易于系統(tǒng)移植,擴(kuò)展,使用了interface,factory,xml等方法 5. 核心代碼是在\"SAMPLE\\base\\DBGW\"里 6. SAMPLE演示了查詢,增加,刪除記錄和如何使用存貯過(guò)程 如果你沒有做過(guò)，那這些代碼可以用來(lái)學(xué)習(xí)誠(chéng)然，這并不是最好的代碼，而且中國(guó)高人如云學(xué)海無(wú)涯
上傳時(shí)間： 2015-09-22
上傳用戶：
huffman編碼. 把一個(gè)英文字母,空格,句號(hào).一共有28個(gè) character. 先求每個(gè)字符出現(xiàn)的頻率. 然后用頻率對(duì)這個(gè)文件進(jìn)行哈夫曼編碼. 然后再進(jìn)行解碼. 運(yùn)行的時(shí)候需要在VC++ 工程->設(shè)置->調(diào)試->程序變量里加E:\SAMPLE.txt E:\encode.txt E:\decode.txt 然后把英文文件放到E盤里.名叫samole.txt, 還有在E里新件2個(gè)txt文件.名叫encode.txt,decode.txt. 編碼后的二進(jìn)制save到encode.txt,解碼后的英文字符save到decode.txt了.
標(biāo)簽： character huffman 編碼 頻率
上傳時(shí)間： 2015-09-26
上傳用戶：thuyenvinh
THIS SOURCE CODE IS PROVIDED AS IS , WITH NO WARRANTIES WHATSOEVER, EXPRESS OR IMPLIED, INCLUDING ANY WARRANTY OF MERCHANTABILITY, FITNESS FOR ANY PARTICULAR PURPOSE, OR ARISING FROM A COURSE OF DEALING, USAGE OR TRADE PRACTICE, RELATING TO THE SOURCE CODE OR ANY WARRANTY OTHERWISE ARISING OUT OF ANY PROPOSAL, SPECIFICATION, OR SAMPLE AND WITH NO OBLIGATION OF NOKIA TO PROVIDE THE LICENSEE WITH ANY MAINTENANCE OR SUPPORT. FURTHERMORE, NOKIA MAKES NO WARRANTY THAT EXERCISE OF THE RIGHTS GRANTED HEREUNDER DOES NOT INFRINGE OR MAY NOT CAUSE INFRINGEMENT OF ANY PATENT OR OTHER INTELLECTUAL PROPERTY RIGHTS OWNED OR CONTROLLED BY THIRD PARTIES
標(biāo)簽： WARRANTIES WHATSOEVER INCLUDING PROVIDED
上傳時(shí)間： 2013-12-27
上傳用戶：fanboynet
Octane v1.01.20 The Open Compression Toolkit for C++ . The Open Compression Toolkit is a set of modular C++ classes and utilities for implementing and testing compression algorithms. Simple interface and skeleton code for creating new compression algorithms. Complete testing framework for validating and comparing new algorithms. Support for algorithms that use external dictionaries/headers. Utility classes and SAMPLE code for bitio, frequency counting, etc.
標(biāo)簽： Compression Toolkit Open The
上傳時(shí)間： 2013-12-31
上傳用戶：dbs012280
1. 對(duì)給定語(yǔ)料估計(jì)其基音周期。 要求用MATLAB語(yǔ)言實(shí)現(xiàn)有關(guān)基音檢測(cè)算法，并給出檢測(cè)結(jié)果。2. 實(shí)驗(yàn)語(yǔ)料：aoYiSheng.raw 發(fā)音：“茅以升”；時(shí)長(zhǎng)0.9s；采樣率：8kHz；量化精度為16bits/SAMPLE；數(shù)據(jù)格式 LSB,MSB分析幀長(zhǎng):20ms(160樣點(diǎn))總幀數(shù)：45
上傳時(shí)間： 2014-12-01
上傳用戶：z754970244
要學(xué)MFC必看之書，由Jeff Prosise編寫。下面是作者前言： The production of this book required the efforts of many people, but two in particular deserve to be singled out for their diligent, sustained, and unselfish efforts. Sally Stickney, the book s principal editor, navigated me through that minefield called the English language and contributed greatly to the book s readability. Marc Young, whose talents as a technical editor are nothing short of amazing, was relentless in tracking down bugs, testing SAMPLE code, and verifying facts. Sally, Marc: This book is immeasurably better because of you. Thanks.
標(biāo)簽： MFC
上傳時(shí)間： 2015-10-20
上傳用戶：waizhang
Input The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. The first line of each case contains N, and the second line contains N integers giving the time for each people to cross the river. Each case is preceded by a blank line. There won t be more than 1000 people and nobody takes more than 100 seconds to cross. Output For each test case, print a line containing the total number of seconds required for all the N people to cross the river. SAMPLE Input 1 4 1 2 5 10 SAMPLE Output 17
標(biāo)簽： the contains integer number
上傳時(shí)間： 2015-10-27
上傳用戶：plsee
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
<strike id="64uec"></strike>