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
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
％ because we do not truncate and shift the convolved input ％ sequence, the delay of the desired output sequence wrt ％ the convolved input sequence need only be the delay ％ introduced by the ideal weight vector centred at n=5
标签： the convolved truncate sequence
上传时间： 2015-12-27
上传用户：www240697738
This example streams input from a ADC source to a DAC. An analog signal is acquired block-by-block into SDRAM from the ADC (an AD9244 in this example). The frames are then output with a one-frame delay to the DAC (an AD9744 in this example). In this example, no processing is done on the frames. They are passed unaltered.
标签： block-by-block acquired example streams
上传时间： 2015-12-29
上传用户：bjgaofei
北京大学ACM比赛题目 Write a program to read four lines of upper case (i.e., all CAPITAL LETTERS) text input (no more than 72 characters per line) from the input file and print a vertical histogram that shows how many times each letter (but not blanks, digits, or punctuation) appears in the all-upper-case input. Format your output exactly as shown.
标签： CAPITAL LETTERS program Write
上传时间： 2014-01-17
上传用户：410805624
① 使用自动机技术实现一个词法分析程序； ② 使用算符优先分析方法实现其语法分析程序； 需要先在运行目录下建立一个input.txt文件，将需要分析的文法放在该文件中，分析结果，会输出在output.txt文件中。
上传时间： 2013-12-09
上传用户：stampede
可编程并行接口８２５５Ａ完成的交通灯实验 用８２５５Ａ的Ｂ端口和Ｃ端口控制１２个ＬＥＤ的亮和灭（输出为０则亮，输出为１则灭），模拟十字路口的交通灯。 -programmable parallel interface 8255A completed, the traffic lights experimental 8255A port B and C - I control 12 LED bright and methomyl (output of 0-liang, the output of an anti), the simulation of traffic lights at a crossroads.
上传时间： 2016-08-13
上传用户：来茴
