ffmpg库的源码

一个经典问题的比较好的解决方法-a classic problem of a relatively good solution

王元汉，李丽娟，李银平，结构分析的有限元法与程序设计 一书源程序-Wang Yuan-han, Shelley, LI Yin-ping, structural analysis of the finite element method and procedures for the design of a book source

比较好的带符号数乘法的方法是布斯(Booth)算法。它采用相加和相减的操作计算补码数据的乘积。Booth算法对乘数从低位开始判断，根据两个数据位的情况决定进行加法 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 例如：给定4个城市{1，2，3，4}及其各城市之间的路程 最优路线是1,3,2,4,1， 其最短路程是25-a salesman, traveling salesman problem, a number of cities to sell commodities, the known distance between the city (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. For example : given four cities (1,2,3,4) and the distance between the city optimal route is 1,3,2,4, 1, the shortest distance is 25

应用背景adasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddспомощьюVинаспомощьюVинав。в。спомощьюVинаadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasdddddddddddddddddddddddddddddddddddddddddddadasddddddddddddddddddddddddddddddddddddddddddd关键技术234567891011121314151617181920РазмерА（- 2，- 4） ； ；делаюя= - 3,2читать*，（В（Я，какДж），ДжвС= - 4,0） ；конецсделатьзвонокмассивные（В，Н）печать*，встопконецподпрограммымассивные（В，Н）измерениеВ（Н） ； ；нея= 2，н2СделатьДж=Я，НВвKиВ=Н-ДЖ+Яесли（в（

boosting的源代码，包括C++与matlab的混合编程。程序通俗易懂，经过运行测试。

求解整数的最大公约数-the common denominator for Solving Integer

自己用C++做的简单的迷宫，特点是可以自定义迷宫的属性-own use C to do simple maze, which is characterized can define the attributes of the maze

用c编写的N皇后问题-used to prepare N Queens

用全选主元高斯-约当消去发求解系数矩阵为稀疏矩阵的方程组-Select All PCA with Gaussian- about when fat elimination for solving sparse matrix for the coefficient matrix of equations