I-frame 技术资料

每对节点间最短路径 Floyd-Warshall 算法 D[i,j]表示从i到j的最短距离； P[i,j]表示从i到j的最短路径上j 的父节点

（一） 求a~b 之间各个数的约数个数之和。(其中包括a和b在内) ans = sigma(f(i)) , (a <= i <= b) , 其中f(i)表示i的约数的个数

设I是一个n位十进制整数。如果将I划分为k段，则可得到k个整数。这k个整数的乘积称为I的一个k乘积。 编程任务：对于给定的I 和k，编程计算I的最大k乘积。

This my first program that I learn QT, I think if you run it and then you will learn many thing

linux book, this book is about linux programing. i hope it will help you. i am glad to share my files. thanks :) Moving to Linux S…

I originally wrote this for a Z80 back in the early 80s. I found the source code recently in one of the boxes of printouts I ve ke…

I CAME BACK I BRING LOTS OF THING TO U ALL THIS TUTORIAL FOR DAY3 SESSION SERIES OF UNIX HARDWARE AND NETWORKING CONCEPTS

已知斐波那契数列的定义：F(1)=1,F(2)=1,F(i)= F(i-1)+ F(i-2) (i>=3),编写求该数列前n项的子程序 实现了输入一个数，然后将计算的结果保存在存储器中

This is a simple image sender to a FTP site. it can be usefull if you want to send a Web-CAM frame to a FTP site, and you can refr…

It is design for GSM with s3c44b0x,you can open it with protel99 se ,it can help you ,i think .I great appreciate your support