Welcome![Sign In][Sign Up]
Location:
Search - txt to b

Search list

[Other resourceBFS_DFS_Astar

Description: 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.
Platform: | Size: 2984 | Author: bo | Hits:

[AI-NN-PRBFS_DFS_Astar

Description: 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 BFS, DFS and A* To compile this project, use the following command: g++-O search main.cppThen you can run it:./SearchThe input is loaded from a input file in.txtHere 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.
Platform: | Size: 3072 | Author: bo | Hits:

[Othertxt2bmp

Description: txt to bmp, and you can use it freely
Platform: | Size: 191488 | Author: | Hits:

[ConsoleB_Tree

Description: 用控制台实现了经典的数据结构B树,可以通过测试文件.txt加载已有的B树,有插入,删除,查找的功能,加深对数据结构的理解。-Using the console to achieve the classic B tree data structure, you can pass the test document. Txt already loaded B-tree, there are insert, delete, search functions, to deepen understanding of the data structure.
Platform: | Size: 141312 | Author: waleking | Hits:

[Windows DevelopProject1

Description: This project requires you to write a program that imitates a simple desk calculator. Your calculator must be able to accept an infix expression which at least includes (, ), +, -, *, /, %, and ^ (exponentiation operator, a^b = ab ). If the expression is legal, output its value, else output an error message. Input Specification: Your program must read test cases from a file “input.txt”. In the file there are several test cases, each occupies one line that contains an infix expression. Proceed until the end of the file. Output Specification: For each test case, output to a file “output.txt” in one line the value of that expression (accurate up to two decimal places), or an error message “ERROR IN INFIX NOTATION”. -This project requires you to write a program that imitates a simple desk calculator. Your calculator must be able to accept an infix expression which at least includes (,),+,-,*, /,, And ^ (exponentiation operator, a ^ b = ab). If the expression is legal, output its value, else output an error message. Input Specification: Your program must read test cases from a file
Platform: | Size: 39936 | Author: 云从龙 | Hits:

[AlgorithmSum

Description: 算法实现题1-2 连续和问题 « 问题描述: 给定一个正整数n,计算有多少个不同的连续自然数段,其和恰为n。例如,当n=27 时,有4 个不同的连续自然数段的和恰为27:2+3+4+5+6+7;8+9+10;13+14;27。 « 编程任务: 给定一个正整数n,试设计一个O(n)时间算法,计算有多少个不同的连续自然数段的 和恰为n。 « 数据输入: 由文件input.txt提供输入数据。文件的第1 行是正整数n。 « 结果输出: 程序运行结束时,将计算出的和恰为n的连续自然数段的个数输出到output.txt中。 输入文件示例 输出文件示例 input.txt 27 output.txt 4 -Algorithm 1-2 consecutive title and the issue of ?Description of the problem: given a positive integer n, calculate the number of consecutive natural number of different paragraph, and its and exactly n. For example, when n = 27, there were four different sections for natural and exactly 27:22 B! 3+ 4+ 5+ 6+ 7 8+ 9+ 10 13+ 14 27. ?Programming tasks: Given a positive integer n, try to design a O (n) time algorithm to calculate the number of different section of consecutive natural numbers and exactly n. ?Data input: from file input.txt to provide input data. Paragraph 1 line is a positive integer n. ?The results output: program to run at the end will be calculated and exactly the consecutive natural number n the number of paragraphs in the output to output.txt. Sample input file output file example input.txt 27 output.txt 4
Platform: | Size: 1024 | Author: Tonsen | Hits:

[Mathimatics-Numerical algorithmsdivi

Description: 正整数x 的约数是能整除x 的正整数。正整数x 的约数个数记为div(x)。例如,1,2,5,10 都是正整数10 的约数,且div(10)=4。设a 和b 是2 个正整数,a≤b,找出a 和b之间约数个数最多的数x。 对于给定的2 个正整数a≤b,编程计算a 和b 之间约数个数最多的数。 数据输入 输入数据由文件名为input.txt的文本文件提供。文件的第1 行有2 个正整数a和b。 结果输出 程序运行结束时,若找到的a 和b 之间约数个数最多的数是x,将div(x)输出到文件output.txt中。 输入文件示例 输出文件示例 input.txt output.txt 1 36 9 -Positive integer x can be about a few of the positive integer x divisible. Positive integer x the approximate number recorded as the number of div (x). For example, 1,2,5,10 are about 10 positive integer number, and div (10) = 4. Set a and b are two positive integers, a ≤ b, to find a and b between about a few number of the largest number of x. For a given two positive integers a ≤ b, Programming calculated a and b between about a few number of the largest number. Data entry input data from the document text file named input.txt provide. File line 1 has two positive integers a and b. The results run the end of the output, if found between a and b of about a few number of the largest number are x, the div (x) of output to a file output.txt. Sample input file output file example input.txt output.txt 1 36 9
Platform: | Size: 1024 | Author: 林雨 | Hits:

[Windows Developzifutongjiqi

Description: 统计文档a.txt中字符数,并保存到b.txt中-Statistics document the number of characters a.txt Medium and Medium Save to b.txt
Platform: | Size: 188416 | Author: 南凌寒 | Hits:

[SCMBSLA

Description: MSP430单片机串行编程软件,支持光电隔离串口及USB写入器.-MSP430 single chip computer serial programming software to support serial and USB Optical isolation writer.
Platform: | Size: 918528 | Author: Jack Wang | Hits:

[VxWorksgppve_3_5_wrSbc8548_2_0_3

Description: MPC8548 SBC开发板基于VXworks的 BSP资料,比较全,可以直接在SBC开发板上运行-this version of BSP will update the following driver files as well as the BSP. target/config/comps/vxWorks/11rapidio.cdf target/h/drv/end/gei82543End.h target/src/drv/end/gei82543End.c target/src/hwif/busCtlr/m85xxRio.c target/src/hwif/vxbus/usrRapidIOBus.c Pre-Installation Requirement: 1) You should consider backing up gei82543End.h/gei82543End.c/m85xxRio.c so you can undo the install if necessary. Post Installation Steps: 1) For project builds to work you should close Workbench if you are using it. Next remove the file $WIND_BASE/target/config/comps/vxWorks/CxrCat.txt . You may now restart Workbench and create vxWorks image projects based on the new BSP. 2) A build of the updated gei82543End driver is necessary. In the vxWorks Development Shell, go to $WIND_BASE/target/src/drv/end . Run the following command: make CPU=PPC32 TOOL=sfdiab The gei82543End driver that was installed should be archived into the libdrv.a librar
Platform: | Size: 12461056 | Author: 唐震宇 | Hits:

[Delphi VCLTxtToBin

Description: Example integer Txt To Bin Unit on Delphi
Platform: | Size: 478208 | Author: Alex | Hits:

[Windows Developrfc5004.txt

Description: Abstract In this document, we propose an extension to the BGP route selection rules that would avoid unnecessary best path transitions between external paths under certain conditions. The proposed extension would help the overall network stability, and more importantly, would eliminate certain BGP route oscillations in which more than one external path from one BGP speaker contributes to the churn.
Platform: | Size: 7168 | Author: lie | Hits:

[Crack HackLab2-2

Description: 作为通讯的双方A和B已经共享一个会话主密钥Km。在完成会话密钥Ks的分配后,A利用Ks对特定文件(test-1.txt)进行加密,并发送给B;B利用Ks对密文进行解密,并对比解密后的明文信息同原来的文件是否一致。-As communication between the parties A and B have shared a session master key Km. Upon completion of the distribution of session key Ks, A-Ks for the use of a specific file (test-1.txt) is encrypted and sent to B B using Ks to decrypt the ciphertext, and compare the decrypted plaintext message with the original files are consistent.
Platform: | Size: 1426432 | Author: oubagon | Hits:

[JSP/Javab

Description: 产生10个0~100之间的随机整数,然后利用BufferedWriter类将其写入文件RandmomNUM,txt中。之后再读 取该文件中的数据并求出这10个数的平均数。-Generate a random integer between 0 to 100 in 10, and then use BufferedWriter class to write to a file RandmomNUM txt. Then read the data and calculated the average of the 10 number in the file.
Platform: | Size: 1024 | Author: struggle | Hits:

[WaveletFA18-7307-B-2

Description: map图转换成的txt格式文件,作为事例,请各位友友参看-The map figure conversion to TXT file format
Platform: | Size: 3072 | Author: 阿辉 | Hits:

[File Formatprograms-txt

Description: 1. Transfer function to state space model transfer function to state space A=[1 1 1] B=[1 6 11 6] [A,B,C,D]=tf2ss(num,den)
Platform: | Size: 5120 | Author: chaithu | Hits:

[FlashMXflash-doc

Description: 1、创建一个文本框,给此文本框一个变量名txt; 2、文本格式为:动态; 3、选:多行输入 4、在第一帧上增加脚本语言。(按F9) loadVariablesNum("b.txt",0) //b.txt是文件名,0是场景中的根目录 然后打开poems.txt文件,在记事本里输入:txt= 注意:在加载之前对文本文件进行转换,另存为Unicode编码格式。-1, create a text box, the text box to a variable name txt 2, the text format: dynamic 3, the election: multi-line input 4, in the first frame to add scripting language. (Press F9) loadVariablesNum (" b.txt" , 0) //b.txt is the file name, and 0 is the root of the scene and then open poems.txt file in Notepad, enter: txt = Note: Before loading Before converting a text file, save as Unicode encoding format.
Platform: | Size: 7168 | Author: wu | Hits:

[Crack HackCentralized-symmetric-key

Description: 完成集中式对称密钥的分配工作 说明:作为通讯的双方A和B,都已经分别和KDC拥有会话密钥Ka和Kb,但A、B之间事先没有保密通道,需要依赖KDC为它们的会话分配临时密钥Ks。在完成会话密钥Ks的分配后,A利用Ks对特定文件(test-1.txt)进行加密,并发送给B;B利用Ks对密文进行解密,并对比解密后的明文信息同原来的文件是否一致。 要求: (1)JAVA语言编程实现,基于DES完成对称密码技术的加/解密(JAVA有库函数支持); (2)通信内容为一文本文件(test-1.txt); (3)基于网络完成密钥分配工作(作为通信的双方A、B应部署于两台主机上,KDC可以部署在其中一台主机上或第三台主机上); (4)所分配的对称密钥皆为一次一密,随机产生; (5)具体密钥分配过程请以课本中基于KDC的集中式密钥分配方案为参考,完成从步骤1到步骤5的全过程;-Complete centralized allocation symmetric key Description: As a communication between the parties A and B, respectively, and the KDC already has a session key Ka and Kb, but the A, B no secret passage between the advance, they need to rely on the KDC allocate temporary session key Ks. Upon completion of the session key Ks allocation, A Ks on the use of a specific file (test-1.txt) is encrypted and sent to B B use Ks decrypt the ciphertext, and compare the decrypted plaintext message with the original files are consistent. Requirements: (1) JAVA programming language, based on the DES symmetric cryptographic techniques to complete the encryption/decryption (JAVA library functions are supported) (2) the content of communications as a text file (test-1.txt) (3) complete network-based key distribution job (as the communication between the parties A, B should be deployed on both hosts, KDC can be deployed on one host or a third host) (4) are allocated once a secret symmetric key ra
Platform: | Size: 4096 | Author: 丁元元 | Hits:

[Internet-Networkxxxxxxx

Description: A,B俩个文件,将A文件内容写入B文件前面,输入若干组数字,将其保存在文件中-A and B file,add A contents to B file. input some numbers,save the number in the txt
Platform: | Size: 246784 | Author: shiyong | Hits:

[matlab三次B样条轨迹规划

Description: 根据三次B样条公式,算出样条曲线,并取样,把三维坐标写进txt,再用matlab绘制三维三次B样条曲线(According to the cubic B-spline formula, calculate the spline curve, and sample, the three-dimensional coordinates into the txt, and then draw three-dimensional cubic B-spline curve)
Platform: | Size: 2540544 | Author: liwei007 | Hits:
« 12 3 4 5 »

CodeBus www.codebus.net