系统级编程 tinylinker

网络聊天程序，实现了添加好友，好友之间聊天，以及注册等功能(Network chat program, the realization of the add a friend, chatting among friends, as well as features such as register)

一个数字梯形，选择k条路线，每条路线从第一层的某个数开始，每次进入下一层到达左下或者右下的数字，直到最后一层为止。每条路线不能经过相同的路径，但是可以经过相同的数字节点。 输出一个整数，表示能得到的最大的k条路径经过的数字之和(A digital ladder, the K route, each route the first layer of a number, each time to enter the next layer to reach the left or right next to the number, until the final layer. Each route can not pass through the same path, but can pass through the same number of nodes. Output an integer representing the sum of the number of the largest K paths that can be obtained)

pat advanced level 1005. Spell It Right(Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English. Input Specification: Each input file contains one test case. Each case occupies one line which contains an N (<= 10100). Output Specification: For each test case, output in one line the digits of the sum in English words. There must be one space between two consecutive words, but no extra space at the end of a line. Sample Input: 12345 Sample Output: one five)

电磁场圣经，林为干院士的书,学习电磁场重要材料(EMF Bible, it' s dry academician of the book, an important material for studying the electromagnetic field)

基于doc_view多文件示例（源码）,可以改变文档的图片工具.好好玩玩啊(Doc_view based on multi-file examples (source), can change the document image tools. Good play ah)

SCSI管理工具mtx window应用（引用开源）

某公司收到若干报价，然后报价由低到高进行排序。设最低报价为F,最高报价为G。n=0.2*(G-F) 设A，B，C，D，E五个等距区间并取： A=[F,F+n） B=[F+n,F+2n) C=[F+2n,F+3n) D=[F+3n,F+4n) E=[F+4n,G) 所有的报价都按各自的大小，分别列入上面五个区间。各自区间内的最小报价为该区间的代表报价。如果某区间内没有报价 则以小于该区间的且与该区间相邻的区间内的最高报价代表该区间报价，如果该区间与与之相邻的较小区间内都没有报价则该区间不参加最后计算。取各区间的代表值， 求出其平均值 做为评标基准报价 (A company received a number of quotations, and quotations from low to high order. Minimum price for the F, the highest offer for the G. n = 0.2* (GF) Let A, B, C, D, E, and five equidistant intervals obtained: A = [F, F+ n) B = [F+ n, F+2 n) C = [F+ 2n, F+3 n) D = [F+3 n, F+4 n) E = [F+4 n, G) All quotes are by their size, five were included in the above range. The minimum offer their own range representative of the range quoted. If a range does not offer less than the range of places and range of adjacent intervals with the highest offer within the offer on behalf of the interval, if the interval and the adjacent smaller range do not offer the range not to participate the final calculation. Take the representative value of each interval, calculate the average price as a benchmark evaluation)

C#动态显示图象,原代码经过测试,完全可以运行.-Dynamic display image

说明：  说明： bmp压缩算法，vc++实现，可以将抓屏，普通bmp图片文件进行高度压缩，提高传输速度，减小存储空间(Description: BMP compression algorithm, VC + + implementation, can capture screen, ordinary BMP image files for high compression, improve transmission speed, reduce storage space)

说明：  我用过了，很好的！！建议你们也看看！不知道能不能看到！(I used, and very good! ! Suggest that you also take a look at! Do not know can not see!)