對讀入的某個文本文件input.txt中，拆出英文單詞，輸出一個按字典順序排列的單詞表，結果輸出在文本文件output.txt中，每個單詞一行，并在單詞后輸出該單詞出現的個數，兩個字段之間用逗號分隔。約定單詞僅由英文字母組成，單詞間由非英文字母分隔，相同單詞只輸出一個，大小寫不區分。 利用二叉樹實現
上傳時間： 2015-07-04
上傳用戶：yulg
h.263 c編碼源碼。目錄下有input。qcif原始未壓縮文件，運行程序生成重建文件recon。qcif和壓縮后文件output。263文件。
上傳時間： 2013-12-19
上傳用戶：ljmwh2000
工程計算MATLAB code to calculate the reorthogonalized sine tapers input: N = the length of the time series data to be tapered p = the number of tapers requested I = the gap structure a vector of length N I(t) = 1 if there is data at time t, t=1, ..., N I(t) = 0 if there is a gap at time t output: X = N-by-p vector of the reorthogonalized sine taper
標簽： the reorthogonalized calculate MATLAB
上傳時間： 2013-12-17
上傳用戶：wangyi39
The book "The Finite Difference Time Domain for Electromagnetics" by Karl Kunz and Raymond Luebbers, CRC Press, 1993, contains an FDTD code and output files in Appendix B. The same code and output files are contained in this directory.
標簽： Electromagnetics Difference The Luebbers
上傳時間： 2013-12-29
上傳用戶：chongcongying
EXAMPLE SOURCE CODE FOR IMPLIB FILTER This filter accepts input through the standard input stream, convertsit and outputs it to the standard output am. The streams are linkedthrough pipes, such that the input stream is the output from the import librarian being invoked, and the output stream is connected to the message window of the IDE, ie.
標簽： input standard EXAMPLE accepts
上傳時間： 2014-11-18
上傳用戶：siguazgb
EXAMPLE SOURCE CODE FOR TASM FILTER his filter accepts input through the standard input stream, converts it and outputs it to the standard output stream. The streams are linked through pipes, such that the input stream is the output from the assembler being invoked, and the output stream is connected to the message window of the IDE, ie.
標簽： input standard EXAMPLE accepts
上傳時間： 2014-01-13
上傳用戶：小碼農lz
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
標簽： Implemented following compile command
上傳時間： 2014-01-01
上傳用戶：lhc9102
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
標簽： the contains integer number
上傳時間： 2015-10-27
上傳用戶：plsee
Input The input contains blocks of 2 lines. The first line contains the number of sticks parts after cutting, there are at most 64 sticks. The second line contains the lengths of those parts separated by the space. The last line of the file contains zero. Output The output should contains the smallest possible length of original sticks, one per line. Sample Input 9 5 2 1 5 2 1 5 2 1 4 1 2 3 4 0 Sample Output 6 5
標簽： contains The blocks number
上傳時間： 2015-10-27
上傳用戶：lepoke
Input The input consists of two lines. The first line contains two integers n and k which are the lengths of the array and the sliding window. There are n integers in the second line. Output There are two lines in the output. The first line gives the minimum values in the window at each position, from left to right, respectively. The second line gives the maximum values. Sample Input 8 3 1 3 -1 -3 5 3 6 7 Sample Output -1 -3 -3 -3 3 3 3 3 5 5 6 7
上傳時間： 2014-12-21
上傳用戶：hongmo
