(ThebeginningofawinterbreaknearSpringFestivalisalwaysthebeginningofapeakperiodoftransportation.Ifyouhaveevertriedtogenotatrainticketatthattime.youmusthavewitnessedtheendlessqueuesinfrontofeveryticketboxwindow.Ifaguyhasseenhisfriendinaqueue,thenitisverymuchlikelythatthisluckyguymightgostraighttohisfriendandaskforafavor.Thisiscalled"jumpingthequeue."Itisunfairtotherestofthepeopleintheline,but,itislife.Yourtaskistowriteaprogramthatsimulatessuchaqueuewithpeoplejumpingineverynowandthen,assumethat,ifoneinthequeuehasseveralfriendsaskingazrfavors.hewouldarrangetheirrequestsinaqueueofhisown) - IMDN开发者社群-imdn.cn">

网站首页

登录

jumping_the_queue

于 2006-11-04 发布文件大小:3KB

 0  176

下载积分: 1 下载次数: 6

我要下载

代码说明：

The beginning of a winter break near Spring Festival is always the beginning of a peak period of transportation. If you have ever tried to get a train ticket at that time, you must have witnessed the endless queues in front of every ticket box window. If a guy has seen his friend in a queue, then it is very much likely that this lucky guy might go straight to his friend and ask for a favor. This is called "jumping the queue". It is unfair to the rest of the people in the line, but, it is life. Your task is to write a program that simulates such a queue with people jumping in every now and then, assume that, if one in the queue has several friends asking for favors, he would arrange their requests in a queue of his own(The beginning of a winter break near Spring Festival is always the beginning of a peak perio d of transportation. If you have ever tried to ge not a train ticket at that time. you must have witnessed the endless queues in fr ont of every ticket box window. If a guy has seen h is friend in a queue, then it is very much likely that this lucky guy mi ght go straight to his friend and ask for a favor. This is called "jumping the queue." It is unfair to the rest of the people in the line, but, it is life. Your task is to write a program that si mulates such a queue with people jumping in ever y now and then, assume that, if one in the queue has several friends asking az r favors. he would arrange their requests in a queue of his own)

文件列表：

jumping_the_queue.c

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

the-static-binary-tree-and-input
建立一个静态二叉树，并对他进行先序遍历，已在vc6.0上运行通过。(To establish a static binary tree, and carries on his first sequence traversal, has run through in vc6.0 )

2014-01-14 12:37:28下载

积分：1
EncryptDecrypt
说明： Sample Code for encryption and decription

2019-02-03 20:09:05下载

积分：1
GIS
说明：这就是陈建春的《用Visual C++开发GIS系统》的配套代码。用来给初学者熟悉VC++图形编程很不错，我当初学MFC的时候就是照着这本书上手的。但作为一个GIS系统来说缺少一些必要的要素，比如大数据量的管理、空间索引、符号化、投影等等等等等。以现在的眼光看来整个系统的架构设计也不是太好。这本书再版后改名为《矢量图形系统开发与编程》，内容变化不大("using Visual C development of GIS systems" supporting code. For beginners to the VC familiar with graphical programming quite well, and I had the time to learn MFC is shining on this book in the business. But as a GIS systems lack the necessary elements, such as the large amount of data management, spatial indexing, symbols, such as projectors, etc.. Now the point of view of the entire system architecture design is not too good. This book reprinted later renamed as "vector graphics systems development and programming", little change)

2006-03-07 12:45:39下载

积分：1
WizardProp
WizardProp上课用到的，写的一些东西小程序(WizardProp class used)

2013-01-19 23:32:46下载

积分：1
code
自己写的TMS320F28335代码，内含DA、AD、液晶驱动、峰值检测、频率采集等程序，供参考(TMS320F28335 write their own code, containing DA, AD, LCD driver, peak detection, frequency acquisition procedures for reference)

2015-06-23 11:30:14下载

积分：1
iperf_win
Iperf windows版，新手学习用，相当不错.(Iperf windows version, novices to learn, is quite good.)

2013-04-15 15:31:26下载

积分：1
terrainLod
说明：一个关于地形LOD渲染得例子，给出了渲染得全部代码(a rendering of the terrain in LOD examples given in all rendering code)

2006-03-22 20:45:51下载

积分：1
BlueTooth
蓝牙连接实例，实现蓝牙连接。。。。。。。(Bluetooth connection instance, to achieve a Bluetooth connection. . . . . . .)

2010-11-10 11:14:22下载

积分：1
CPPPrimer4forch
C++Primer中文版_第4版__中英对照.pdf，很好的一本C++书籍(C++ Primer 4th Edition Chinese version _ __ bilingual. Pdf, good one C++ books )

2011-12-15 00:00:57下载

积分：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

696518资源总数
105885会员总数
31今日下载