[Windows编程] 三星376.1,07,97规约解析工具
376.1 和645-2007 规约解析
376.1 and 645-2007 protocol parse (2020-05-07, C/C++, 4521KB, 下载12次)
[Windows编程] 源
为简化问题，假设南京现有三条地铁线：1号线、2号线和3号线，线路都是双向的。3条地铁线的站点名分别如下，地铁线交叉的换乘点用T1、T2等表示。请根据3条地铁线的站点和换乘点构造图。编写程序，任意输入两个站名名称，输出乘坐地铁最少需要经过的车站数量（含输入的起点和终点，换乘站点只计算一次）。
地铁1号线（直线）经过车站：A1 A2 A3 T1 A4 A5 A6 A7 A8 T2 A9 A10 A11 A12 T3 A13 A14 A15 T4 A16
地铁2号线（直线）经过车站：B1 T5 B2 B3 B4 B5 T2 B6 B7 B8 B9 B10 B11 T3 B12 B13 T6 B14 B15
地铁3号线（环线）经过车站：C1 C2 C3 C4 C5 T1 C6 C7 C8 C9 C10 T5 C11 C12 C13 T6 C14 C15 T4 C16 C17 C18
In order to simplify the problem, it is assumed that there are three metro lines in Nanjing: Line 1, line 2 and line 3, all of which are bidirectional. The station names of the three metro lines are respectively as follows, and the transfer points of metro line crossing are represented by T1, T2, etc. Please refer to the structural drawing of the stops and transfer points of the three metro lines. Write a program, input the names of two stations, output the minimum number of stations that need to pass by the subway (including the input starting point and terminal point, the transfer station is only calculated once). Metro Line 1 (straight line) passing station: A1 A2 A3 T1 A4 A6 A7 A8 T2 A9 A10 a11 A12 T3 A13 A14 A15 T4 a16 Metro Line 2 (straight line) passing station: B1 T5 B2 B3 B4 B5 T2 B6 B7 B8 B9 B10 B11 T3 B12 B13 T6 B14 B15 Metro Line 3 (ring line) passing station: C1 C2 C3 C4 C5 T1 C6 C7 C8 C9 C10 T5 C11 C12 C13 T6 C14 C15 T4 C16 C17 C18 (2020-04-05, C/C++, 3KB, 下载0次)
[Windows编程] DCconvertIII
in 2 bytes using USCI_A, sent with the LSB first. I set the loopback bit UCLISTEN so that
they are also received in the USCI_A and displayed on the LCD. The listing shows how
the USCI_A0 is
in 2 bytes using USCI_A, sent with the LSB first. I set the loopback bit UCLISTEN so that
they are also received in the USCI_A and displayed on the LCD. The listing shows how
the USCI_A0 is (2020-02-28, C/C++, 123KB, 下载0次)
[Windows编程] HW04Soln
provide yet another thermometer as an example in Listing 10.13. This uses the ADC12 in
SCI_A0 is
provide yet another thermometer as an example in Listing 10.13. This uses the ADC12 in
SCI_A0 is (2020-02-28, C/C++, 437KB, 下载0次)
[Windows编程] VirtuaNES.v0.97.Source
FC模拟器 NES 任天堂 红白机 完全开放的 源代码！。编译需要DirectX 8 SDK支持！。DirectX 8 现在网上比较难找了。。有需要的可以联系我。
FC simulator NES Nintendo Red and White Machine completely open source code!. Compilation needs DirectX 8 SDK support!. DirectX 8 is now more difficult to find on the Internet. Contact me if necessary. (2019-04-02, C/C++, 10233KB, 下载3次)
[Windows编程] MatrixChain
求解矩阵链相乘问题时动态规划算法的另一个例子。给定一个n个矩阵的序列（矩阵链）<A1,A2,...,An>，我们希望计算它们的乘积 A1A2...An
为了计算表达式，我们可以先用括号明确计算次序，然后利用标准的矩阵相乘算法进行计算。完全括号化(fully parenthesized)：它是单一矩阵，或者是两个完全括号化的矩阵乘积链的积。
例如如果有矩阵链为<A1,A2,A3,A4>,则共有5种完全括号化的矩阵乘积链。
(A1(A2(A3A4)))、(A1((A2A3)A4))、((A1A2)(A3A4))、((A1(A2A3))A4)、((A1(A2A3))A4)
Another example of dynamic programming algorithm for solving matrix chain multiplication problem. Given a sequence (matrix chain) of N matrices < A1, A2,..., An>, we want to compute their product A1A2... An. In order to calculate expressions, we can first use parentheses to specify the order of calculation, and then use the standard matrix multiplication algorithm to calculate. Fully parenthesized: It is the product of a single matrix or of two completely parenthesized product chains of matrices. For example, if there are matrix chains < A1, A2, A3, A4>, there are five completely bracketed matrix product chains. (A1 (A2 (A3A4), (A1 ((A2A3) A4), ((A1A2) (A3A4), ((A1A2) (A1 A4), ((A1 (A2A3)) A4, ((A1 (A2A3)) A4) and ((A1 (A2A3)) A4) (2018-11-25, C/C++, 1KB, 下载0次)
[Windows编程] Colfax-HOW-Day-05
对性能优化的讨论。本次会议制定了优化路线图，将优化技术分为五类优化。会议的演讲部分展示了一些从这5类技术的一个示例应用程序的N体模拟实施中的应用。该视频还提供了额外的案例研究，在该研究中的优化证明。会议的实践部分的N体模拟和措施的性能提升在英特尔至强E5处理器和第一代英特尔Xeon Phi协处理器获得的优化过程。
In Session 5 we begin the discussion of performance optimization. This session lays out the optimization roadmap that classifies optimization techniques into five categories of optimization. The lecture part of the session demonstrates the application of some of the techniques these 5 categories to an example application implementing the N-body simulation. The video also provides references to additional case studies in which optimization is demonstrated. The hands-on part of the session demonstrates the optimization process for the N-body simulation and measures performance gains obtained on an Intel Xeon E5 processor and an Intel Xeon Phi coprocessor of the first generation.
(2016-11-29, C/C++, 22KB, 下载1次)
[Windows编程] 555
555时基电路，555，它含有两个电压比较器，一个基本RS触发器，一个放电开关管T，比较器的参考电压由三只5K电阻器构成的分压器提供。它们分别使高电平比较器A1的同相输入和低电平比较器A2的反相器输入端的参考电平为2/3VCC和1/3VCC。
555 circuit (2015-08-12, C/C++, 246KB, 下载4次)
[Windows编程] a1
cpp code for tutorial
cpp code for tutorial (2015-04-29, C/C++, 1KB, 下载1次)
[Windows编程] hdu3666
hdu3666 THE MATRIX PROBLEM 你已经拿到了矩阵CN * M,每个元素E * M是积极和拷贝数不超过1000,问题是,如果存在N数字a1,a2,…一个和M数字b1,b2,…,博雅,满足,每个元素在行我乘以ai和每个元素在列j除以bj,此操作后在这个矩阵的每个元素之间是L和U,L表示upperbound下界和U表示这些元素。
hdu3666
You have been given a matrix CN*M, each element E of CN*M is positive and no more than 1000, The problem is that if there exist N numbers a1, a2, … an and M numbers b1, b2, …, bm, which satisfies that each elements in row-i multiplied with ai and each elements in column-j divided by bj, after this operation every element in this matrix is between L and U, L indicates the lowerbound and U indicates the upperbound of these elements. (2013-05-15, C/C++, 1KB, 下载2次)
[Windows编程] seqmul2
As in hand multiplication (see Figure 2), we multiply the bits of the multiplier A
(a3a2a1a0) by the multiplicand (B) starting from the LSB (a0) to the MSB (a3). This forms
4 partial products a0B, a1B, a2B, and a3B. The resulting partial products are added with
each product shifted lefts by one bit position from its predecessor as shown in
As in hand multiplication (see Figure 2), we multiply the bits of the multiplier A
(a3a2a1a0) by the multiplicand (B) starting from the LSB (a0) to the MSB (a3). This forms
4 partial products a0B, a1B, a2B, and a3B. The resulting partial products are added with
each product shifted lefts by one bit position from its predecessor as shown in (2011-12-21, C/C++, 212KB, 下载2次)
[Windows编程] 97
有关潜水艇大战的
请将程序中的main()函数中的
initgraph(&gdriver,&gmode,"e:\\TC") 函数中的"e:\\TC"
更改为你的TC安装目录。
比如你的TC安装目录为D盘的Tools目录下的TC目录，那么上述语句改为：
initgraph(&gdriver,&gmode,"d:\\Tools\\TC")
The submarine in World War set the program main () function in the initgraph (& gdriver, & gmode, " e: \ \ TC" ) function in the " e: \ \ TC" TC change your installation directory. Such as your TC installation directory for the disk D TC Tools directory directory, then the above statement to: initgraph (& gdriver, & gmode, " d: \ \ Tools \ \ TC" ) (2010-05-13, C/C++, 3KB, 下载2次)
[Windows编程] 2
问题描述：给定n个石子，其重量为a1,a2...,an,要求将其划分为m堆，每一份划分的费用定义为这堆石头中最大重量与最小重量的差的平方。总划分费用等于各堆费用之和。
输入：n m 及a1,a2...,an
输出：sum
问题描述：给定n个石子，其重量为a1,a2...,an,要求将其划分为m堆，每一份划分的费用定义为这堆石头中最大重量与最小重量的差的平方。总划分费用等于各堆费用之和。
输入：n m 及a1,a2...,an
输出：sum
Description of the problem: Given n-stones, the weight of a1, a2 ..., an, requests that it be divided into m heap, the cost of each division is defined as the weight of this pile of stone, the largest and the smallest weight of the square of the difference . Divide the total cost is equal to the cost of each stack and the. Input: nm and a1, a2 ..., an output: sum description of the problem: Given n-stones, the weight of a1, a2 ..., an, requests that it be divided into m piles, each division of the cost of is defined as the weight of this pile of stone, the largest and the smallest weight of the square of the difference. Divide the total cost is equal to the cost of each stack and the. Input: nm and a1, a2 ..., an output: sum (2010-01-24, C/C++, 15KB, 下载6次)
[Windows编程] yan0_miss_V1.36
YUN0的软件,MOTOE6手机助手,来电区号显示,来电报号,
YUN0 software, MOTOE6 phone assistants, code calls show to cable, (2008-08-06, C/C++, 813KB, 下载5次)
[Windows编程] a1
Task A
?read from a file, one set of 1000 random values to be sorted and repeat 1000:
o sort data using the iterative sort
?record the total time used for the 1000 calls
?repeat the above steps using the quick sort algorithm.
================ ( 0 InserSort, 0 QuickSort).
Task B
?Repeat the steps in Task A using this time a set of input data of size 5000
================ ( 0 InserSort, 0 QuickSort).
Task C
?Repeat the steps in Task A using this time a set of input data of size 5000 already
sorted.
Task A
?read from a file, one set of 1000 random values to be sorted and repeat 1000:
o sort data using the iterative sort
?record the total time used for the 1000 calls
?repeat the above steps using the quick sort algorithm.
================ ( 0 InserSort, 0 QuickSort).
Task B
?Repeat the steps in Task A using this time a set of input data of size 5000
================ ( 0 InserSort, 0 QuickSort).
Task C
?Repeat the steps in Task A using this time a set of input data of size 5000 already
sorted. (2008-04-02, C/C++, 1KB, 下载2次)
[Windows编程] 94-100
C语言精彩百例第93－100例
第四篇 综合应用篇
实例94 用C语言实现遗传算法
实例95 人工神经网络的C语言实现
实例96 K_均值算法
实例97 ISODATA算法
实例98 快速傅立叶变换
实例99 求解野人与传教士问题
实例100 简单专家系统
C language section 93-100 100 cases of patients with excellent fourth example of the comprehensive application of articles 94 with C language example of genetic algorithm to achieve 95 artificial neural networks to achieve the C-means algorithm 96 K_ examples examples examples 97 ISODATA algorithm Fast Fourier Transform 98 99 examples of problem solving examples of missionaries Savage 100 with a simple expert system (2008-01-14, C/C++, 128KB, 下载69次)
[Windows编程] vc1conv
VC-1 Elementary Stream Converter
Converts HD-DVD 29.97 fps streams with pulldown flags to 23.976 fps
Updated 08/28/2007 - current version is 0.1
VC-1 Elementary Stream Converter
Converts HD-DVD 29.97 fps streams with pulldown flags to 23.976 fps
Updated 08/28/2007- current version is 0.1 (2007-09-25, C/C++, 28KB, 下载888次)
[Windows编程] xlwTwoOne
XLW is a C++ wrapper of the Excel C API described in Microsoft Excel 97 Developer s Kit. It makes Excel API programming automatic. Its powerful interface will empower your C or C++ numerics by embedding them in Excel just like the built-in functions.
XLW is a C++ wrapper of the Excel C API described in Microsoft Excel 97 Developer s Kit. It makes Excel API programming automatic. Its powerful interface will empower your C or C++ numerics by embedding them in Excel just like the built-in functions. (2007-09-06, C/C++, 298KB, 下载27次)
[Windows编程] openssl-0.97.tar
本次上载一个源文件openssl-0.97mm源码
on the source document contains a openssl- 0.97mm FOSS (2006-03-20, C/C++, 2704KB, 下载6次)
[Windows编程] A52
mfc examples a1
mfc examples a1 (2004-09-24, C/C++, 18KB, 下载4次)