-
medo
设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。 编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits. programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)
- 2021-03-22 16:29:16下载
- 积分：1
-
1.8GHz-CMOS
1.8GHz CMOS高效率E类功率放大器(1.8GHz CMOS high efficiency class E power amplifier)
- 2013-10-19 10:22:16下载
- 积分：1
-
sunxinCPPPPT
VC++高级编程孙鑫全20讲PPT讲义，是学习C++的好工具(this is a PPT，about VC++)
- 2011-10-12 19:02:50下载
- 积分：1
-
Selectinto
说明： 利用Select into生成临时表，使用SQL语句生成数据库中的临时表(Use Select into to generate temporary tables, use SQL statements to generate temporary tables in the database)
- 2020-06-16 11:13:54下载
- 积分：1
-
EULER1
说明： Euler 回路问题
.问题描述：
对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次
的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。
.编程任务：
对于给定的图G，编程计算图G 的一条Euler 回路。
.数据输入：
由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个
顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示
图G 的一条边(u,v) 。
.结果输出:
将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。(Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.)
- 2006-03-29 21:31:15下载
- 积分：1
-
28035_bldc_PID
用28035实现对无刷直流电机的PI控制(28035 realized with brushless DC motor control PI)
- 2020-11-19 11:19:37下载
- 积分：1
-
systemfocusdialog
如果你开发过Windows NT系统上的网络软件，肯定碰到过让用户选择要求连接的或登陆的计算机或者域名的情况。这种情况下肯定用过外壳API函数，像SHGetSpecialFolderLocation 和 SHBrowseForFolder，并显示标准的资源管理器对话框(If you develop Windows NT system over the network software certainly encountered allows users to connect selecting the landing or the computer or domain name situation. Under these circumstances certainly used shell API function, and as SHGetSpecialFolderLocation SHBrowseForFolder and display standard resource management for dialog)
- 2004-09-22 23:52:04下载
- 积分：1
-
THQ
此文件是谭浩强C程序设计（第四版）配套PPT课件。内容比书本精炼，简洁，针对性更强。(This file is Hemopurification C Programming (Fourth Edition) supporting PPT courseware. Refined than the contents of the book, concise and targeted.)
- 2011-08-09 19:13:52下载
- 积分：1
-
exosip
说明： 开源的 SIP 电话代码 (Open-source SIP phone code)
- 2008-10-10 20:23:15下载
- 积分：1
-
ProtocolDriver
说明： 是网络的协议驱动源代码框架,对想过滤网络数据的初学者很有帮助(Is the network protocol driver source code framework, and would like to filter network data useful for beginners)
- 2010-04-10 14:33:22下载
- 积分：1
