-
guiji
惯导系统轨迹生成器，能生成不同位置转动和舰船摇摆条件下的陀螺和加速度计数据，用于研究惯导系统(INS trajectory generator can generate different locations and ships swing conditions rotating gyroscope and accelerometer data, inertial navigation systems for research)
- 2013-08-29 09:49:03下载
- 积分：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
-
shiper
Воронежский гос университет, задача по сям
- 2009-10-11 01:30:49下载
- 积分：1
-
ccode
包括汉诺塔、杨辉三角、求根值等c程序，在VC++6.0运行没问题。(Including the Tower of Hanoi, Yang Hui triangle, the value of such c rooting process running in VC++6.0 no problem.)
- 2010-12-15 08:41:27下载
- 积分：1
-
travelingsalesman
用动态规划法求解旅行商问题 已经加入注释 欢迎批评指正(dynamic programming method for the traveling salesman problem has joined Notes welcome criticism correction)
- 2005-06-09 15:40:17下载
- 积分：1
-
distance_between_two_lines
对于给定的两个线段，程序输出这两个线段之间的距离(For a given two line segments, the program output that the distance between two line segments)
- 2009-03-25 16:04:31下载
- 积分：1
-
tongxinlu
通信录源程序。调试环境为TC2.0或者3.0。运行这个程序需要tc提供的几个头文件。(Example source address book, or 3.0 debugging environment for TC2.0. Tc run the program needs to provide several header files.
)
- 2011-12-05 15:03:16下载
- 积分：1
-
lucky38
hangle unicode used AI
- 2011-08-30 18:34:33下载
- 积分：1
-
b64
base64 decoder to decode the original char from base64 encoded string(base64 decoder)
- 2009-07-17 11:03:47下载
- 积分：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
