The soft-engineer ralated data is ready for your study,for the stylist ,for some people having the common goal.
標簽： for soft-engineer the ralated
上傳時間： 2014-01-26
上傳用戶：趙云興
Description: soft source, 1D,absorbing boundary condition (which really only work for epsrel=murel=1), reflection at an interface type ward_fdtd1d to run.
標簽： Description absorbing condition boundary
上傳時間： 2014-10-12
上傳用戶：er1219
Basic Differential Encoding/Decoding of input vector of numeric values
標簽： Differential Decoding Encoding numeric
上傳時間： 2013-12-20
上傳用戶：qiaoyue
by Jay Kadane。Input:a vector with floats.Output:the maximum submatrix.
標簽： submatrix maximum Kadane Output
上傳時間： 2015-10-13
上傳用戶：彭玖華
KEY INPUT DEBUNCE VERILOG
上傳時間： 2014-12-19
上傳用戶：er1219
Input/Data Acquisition System Design for Human Computer Interfacing
標簽： Acquisition Interfacing Computer Design
上傳時間： 2013-12-31
上傳用戶：sardinescn
HDOJ ACM input:The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Each of the following N lines contains two positive integers s and t, representing that a table is to move from room number s to room number t (each room number appears at most once in the N lines). From the N+3-rd line, the remaining test cases are listed in the same manner as above.
上傳時間： 2015-10-18
上傳用戶：三人用菜
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
