-
ScanEmmg
delphi写的控制台定时程序，内容很丰富。定时扫描进程，如果有某一进程，就杀掉。非常不错。总大小才20多k。特此上传。呵呵(delphi write console timer program, the content is very rich. Scheduled scanning process, if there is a process, it is killed. Very good. . Hereby upload. Oh)
- 2013-09-02 15:52:42下载
- 积分：1
-
B06040324_B2
模拟电信计费系统的设计与实现
要求：（1） 计费功能。根据存放在源数据文件中的通话记录和长途费率文件对每一条通话记录计算其通话费用，并将结果保存在费用文件中。其中：
通话费的计算方法如下：
通话费＝长途电话费＋本地电话费
长途电话费＝费率（元/分钟）×通话时长（分钟）
(通话时长不满1分钟的按1分钟计算)
本地电话费为：3分钟以内0.5元，以后每3分钟递增0.2元。
（2） 话费查询。输入一个电话号码，从费用文件中统计该电话号码的所有本地话费、长途话费，并从用户文件中查找其用户名，最后在屏幕上显示：
用户名 电话号码 本地话费 长途话费 话费总计
（3） 话单查询。输入一个电话号码，查询并在屏幕显示该用户的所有通话记录，格式为：
用户名 主叫电话号码 被叫电话号码 通话时长
(Design and implementation of simulation of telecommunication billing system
Requirements: (1) the charging function. According to the calculation of the call charges stored in the source data file in the call records and the long rate documents for each call record, and save the results in cost file. Among them:
The following conversation method to calculate the fee:
Long distance telephone calls =+ local telephone fee
Long distance telephone fee = rate (yuan/minute)* call time (minutes)
(call time less than 1 minutes to 1 minutes)
Local call: 3 minutes 0.5 yuan, increasing 0.2 yuan every 3 minutes later.
(2) calls inquiries. Enter a phone number, all local calls, long-distance calls statistics the phone number from the cost in the file, and find the user name from user file, and finally displayed on the screen:
The user name phone number local calls long distance charges charges totaling
(3) if a single query. Enter a phone number, query and display all the call records of th)
- 2013-09-25 05:53:29下载
- 积分：1
-
template
template 模版函数 函数模版 深入了解(template template template-depth understanding of the function function)
- 2013-07-15 17:33:53下载
- 积分：1
-
lucky38
hangle unicode used AI
- 2011-08-30 18:34:33下载
- 积分：1
-
aPLib-1.01
this is the library to compress and decompress any file. I found it on Net
- 2010-09-10 19:25:46下载
- 积分：1
-
ATM
编写一个控制台程序，模拟在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.)
- 2013-10-14 22:50:17下载
- 积分：1
-
Desktop
调度问题的回溯算法，算法中的经典问题。问题描述：假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。(Scheduling problem backtracking algorithm is the classic problem. Problem Description: Suppose there are n-task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks.)
- 2010-02-19 23:31:11下载
- 积分：1
-
twoservicedemo
examole, run two services...
- 2009-09-16 03:13:46下载
- 积分：1
-
347013
说明： OPNET 无线仿真 PPT + 源码 好好学习吧(OPNET wireless simulation PPT source code)
- 2019-01-04 05:14:51下载
- 积分：1
-
medo
设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)
- 2021-03-22 16:29:16下载
- 积分：1
