登录
首页 » Visual C++ » yinhangmoni

yinhangmoni

于 2012-11-22 发布 文件大小:3KB
0 96
下载积分: 1 下载次数: 5

代码说明:

  这是一个简单的银行模拟系统 1、 客户的到达时间随机 2、 客户需要处理的业务随机(不同业务处理的平均长度不同,例如:取款时间较短,开户和销户时间较长) 3、 处理客户业务所需时间随机(在一定范围内) 4、 使用文本文件记录每个客户到达时间、业务处理时间、业务结束时间 5、 动态显示(刷新时间可调)目前每个窗口累计处理客户数量、等待人数,每个窗口的平均业务处理时间,不同业务类型业务的累计办理量。 (This is a simple bank simulation system 1 customer arrival time random 2, customers need to deal with the business of random (the average length of the different business processes, such as: the withdrawal shorter, longer to open an account and cancel the account) 3, the time required to deal with customer service random (within certain limits) 4, using a text file to record each customer arrival time, business processing time, the business end of time 5 dynamically display (refresh time is adjustable) each window is accumulated to handle the number of customers waiting for the number the average business processing time of each window, different type of business operations total for the amount.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • stuctures
    本系统采用C语言编写,利用邻接链表实现最短路径问题,关键路径问题等(The system uses the C language, using adjacency list realize the shortest path problem, critical path issues)
    2008-05-29 21:11:26下载
    积分:1
  • xiao-yuan-dao-you
    说明:  设计济南大学校园平面图,所含的景点不少于10个。以图中顶点表示校内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等相关信息。 为来访客人提供图中任意景点相关信息的查询。 为来访客人提供图中任意景点的问路查询,即查询任意两个景点之间的一条最短的简单路径。 选作内容: 求校园的关节点。 提供图中任意景点查询,即求任意两点间的所有路径。 校园导游图的景点和道路的修改扩充功能。 扩充道路信息,如道路类别,沿途景色等级,一直可按客人所需分别查询人行路径或车行路径或观景路径。(Design jinan university campus plan, contains at least 10 spots in each vertex said in scenic spots, deposit attractions at the information such as the code name introduction On the path, deposit path length said related information )
    2011-03-21 19:54:06下载
    积分:1
  • polynomial
    本程序实现一元多项式合并。本程序输入方式为按项输入,每输入一个项,会先提示输入项的幂,再提示输入项的系数。(This procedure combined to achieve a dollar polynomial. This procedure according to entry input methods for the input, one for each input item, it will first prompt entry of the power, and then prompts entry of the coefficient.)
    2009-12-16 17:29:54下载
    积分:1
  • nuaa1507_DancingLink_trackback.cpp
    高德纳发明的高效数据结构dancing link,这里是解重复覆盖问题的一个演示(Donald Knuth invented efficient data structure dancing link, here is the solution to repeat coverage of a demonstration)
    2010-03-07 10:54:32下载
    积分:1
  • migongproduce
    迷宫生成器,可以根据需要自己建立各类型的迷宫,而且能求解出线路(Maze maze of various types of generators, according to the needs its own, but also to solve the lines)
    2012-02-10 15:17:36下载
    积分:1
  • chess
    在N*N的棋盘上(1<=N<=10)填入1,2,...N*N共N*N个数,使得任意两个相邻的数之和为素数. (In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total number of N* N so that any two adjacent numbers and prime numbers.)
    2009-06-01 11:21:39下载
    积分:1
  • yeschengxu
    这是数据结构很重要的程序,主要是课后题的答案,和代码,功能很强大(the data struct of the book)
    2013-12-22 23:25:14下载
    积分:1
  • codes
    数据结构相关代码,源码-数据结构算法解析(高一凡 )(Data structure-related code, source code- Data Structure Analysis algorithm (high one where))
    2008-05-23 02:41:54下载
    积分:1
  • Eight-Digital
    说明:  八数码 对任意数字序列重新排序 高级散列函数 MFC基础编程(Eight Digital Reorder the sequence of any number Senior hash function MFC based programming)
    2011-04-11 16:31:59下载
    积分:1
  • 最小生成树
    给定一个带权的无向连通图,如何选取一棵生成树,使树上所有边上权的总和为最小(Given a weighted undirected connected graph, how to select a spanning tree to minimize the sum of all the upper bounds on the tree)
    2017-06-05 17:27:17下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 31今日下载