674569

说明：  在程序加载时出现，可以点击画面跳过。 2.登录窗口 只有在输入正确的用户名的密码时，点击登录，才能登录。 3.主体窗口 主体窗口中显示的是当天的话费清单。 4.显示窗口 显示窗口中显示的是当前的各路中断线的状态。 5.打印窗口 可以打印当天的话费清单。 6.退出程序 退出程序。 7.当前费用 可以结算出从当天的00:00:00到些时的费用总和，以及通话时第总和。 (in loading procedures there, click on the picture to skip. 2. Login window only in the correct user name password, click on Login can be logged. 3. The main window of the main window shows the list of the day's calls. 4. Show window display window shows the current rostrum were interrupted state. 5. Print window and print the same day the calls list. 6. Exit exit. 7. The current cost of clearing it out of 00:00:00 from the day when some of the costs of the total, and its total telephone conversation.)

OpenCF Bluetooth OpenNETCF Bluetooth Widco div hr div B 文件列表 B ： div div(OpenCF Bluetooth OpenNETCF Bluetooth Widco div hr div B file list B: div div)

控制台下的字符串管理程序，并且带有好看的节面（使用其他人的库）(String under the console management program, and with a good-looking face of the section (using other people s libraries))

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

说明：  PPC开发的代码, 希望我们大家共同努力共同分享,请大家多多指教,互相帮助(PPC development code, I hope we all work together to share, please advise and help each othe)

说明：  用冲激响应不变法和双线性变换法设计IIR的MATLAB程序(Design of MATLAB Program for IIR by Impulse response Invariant method and Bilinear Transformation method)

集合的运算：交、并、补（难度系数：1.1） 全集：大写字母 ‘A’~’Z’ 要求实现以下功能： 1、集合的输入：自动去掉重复和非法的字符 2、集合的显示：输出集合的全部元素 3、输出一个给定集合的补集 4、输出两个给定集合的交集和并集 (jiao bing bu)

通信原理实验指导书,包括全部通信原理章节,原理分析,硬件解释,编程指导等(The communication principle experiment instruction book, including all the communication principle chapter, the principle analysis, the hardware explanation, the programming instruction and so on)

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

操作系统中的 内存管理 FIFO算法模拟(OS FIFO memory management algorithm simulation)