dosfstools-2.11.src.tar

this is the library to compress and decompress any file. I found it on Net

template 模版函数 函数模版 深入了解(template template template-depth understanding of the function function)

编写一个控制台程序，模拟在ATM机的存款和取款过程，当输入给定的卡号和密码（初始卡号和密码到数据文件里查看）时，系统能登录ATM系统，根据用户的身份不同显示不同的程序界面；取款 　　每次取款金额只能为100的倍数，总额不超过2000元，不允许透支。且取款之后，要记录取款的金额和时间。 存款 　　每次存款金额只能为100的倍数，总额不超过2000元。 修改密码 　　新密码长度不小于6位，不允许出现6位完全相同的情况，只有旧密码正确，新密码符合要求，且两次输入相同的情况下才可以成功修改密码。(Write a console program to simulate the ATM deposits and withdrawals process, when you enter a given number and password (the initial number and password to the data file view), the system can log in ATM systems, according to the user' s identity different display different The program interface withdrawal amount each withdrawal can only be a multiple of 100, the total does not exceed 2,000 yuan, does not allow overdrafts. And withdrawals after the withdrawal of the amount to be recorded and time. Deposit Amount per Deposit only a multiple of 100, totaling no more than 2,000 yuan. Change Password New Password length not less than six, allowed six identical situation, only the old password is correct, the new password meets the requirements, and enter the same case twice before they can successfully change the password.)

设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)

队列的顺序定义，队列的调用算法等，队列的模板类及其实现(Defined in the order queue, queue calls algorithm, queue template class and its implementation)

从控制台输入一个字符串，然后再输入想要查找的字符串，判断要查找的字符串是不是在第一次输入的字符串中出现过。(find substring in a source string)

template 模版函数 函数模版 深入了解(template template template-depth understanding of the function function)

设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)

VC中容器和游标的使用，一个简单的例子。。(VC cursor in the containers and the use of a simple example. .)

examole, run two services...