Search - car - CodeBus

Search - car - List

[Data structs] car DL : 0: 停车场管理系统 c语言实现停车场拥有M个车位和一条进入停车场的便道，便道上最多停放N辆汽车。汽车要想进入车位，首先进入便道等候。若有空闲车位，则停车入位，否则在便道继续等候，直至有车位空出。若便道已经停满等候的汽车，后到达的汽车只能离开，选择其他停车场。设计一个停车场管理系统，模拟停车场的运作，并统计停车场的收入。-Parking Management System with M c language parking spaces and a sidewalk into the parking lot, parked up on the sidewalk N cars. To enter the car parking spaces, first into the pavement waiting. If free parking, the parking into place, or in the sidewalk to wait until the needed spot. If the sidewalk is already full of parked cars waiting, after the arrival of the vehicle to leave, choose a parking lot. Designing a car park management systems, simulation parking operations and parking revenue statistics.
Date : 2011-12-13 Size : 2.27kb User : testsb
[Data structs] 停车场 DL : 0: 我的数据结构的实验题，停车场，用栈和队列模拟停车场，实现进车和出车-my data structure experiment, a car park, with Stack and Queue simulated car parks, to achieve progress and out of cars
Date : 2025-12-17 Size : 249kb User : 胡小勇
[Data structs] 停车场管理系统 DL : 0: 数据结构中利用栈模拟停车场管理，用C语言编写。-data stack structure using simulated car park management, with C language.
Date : 2025-12-17 Size : 2kb User : 黄和
[Data structs] chechang DL : 0: 数据结构作业－停车场管理-operating data structure-the car park management
Date : 2025-12-17 Size : 3kb User : 袁继禹
[Data structs] 停车场管理系统3 DL : 0: 停车场管理系统2（数据结构实习报告）-car park management system 2 (data structure internship report)
Date : 2025-12-17 Size : 2kb User : 罗飞
[Data structs] 200518174534292 DL : 0: 停车场管理系统，比较复杂，供大家学习参考！-car park management system, more complex, for your study reference!
Date : 2025-12-17 Size : 200kb User : 郑萍
[Data structs] 停车场模拟 DL : 0: 利用栈和队列实现停车场的管理，包括车的进出及计费。-use stack and queue to achieve the management of car parks, including vehicle access and billing.
Date : 2025-12-17 Size : 2kb User : cuckoo
[Data structs] 复件轮渡问题 DL : 0: 1．汽车轮渡口，过江渡船每次能载10辆车过江，过江车辆分为客车类和货车类，上渡船有如下规定：同类车先到先上船，客车先于货车上渡船，且每上4辆客车，才允许上一辆货车。若等待客车不足4辆，则从货车代替，若无货车等待允许客车上船。试写一个算法模拟渡口管理。算法设计: 1客车和货车均建立一个链式队列，初始均为空。以后来一辆车不是货车就是客车，因此可以说整个程序的事件驱动event就是这两个,客车表示1，货车表示0. 2轮船还没有到达时客车和货车均按次序排在各自队列中。 3轮船到达时，根据两个队列的情况，分别处理。处理如下： a 客车数不满4辆，则将排在前面的货车上船，但总数不能超过10，若没有货车等待，客车直接上船。 b 客车数满4，但不满8辆，客车先上，排在前面的只有一辆货车可以上船，若没有货车等待则货车不上。 c 客车满8辆但不满10，客车上船，排在前面的货车最多可以上2辆，但总数不能超过10。 d 客车满10，则全上客车,但总数不能超过10。 -1. I car ferry, crossing the river each ferry can carry 10 cars crossing the river, crossing the river into passenger vehicles and goods category, Ferry on the following provisions : first vehicle in a first embarkation, the first passenger ferry in the truck and four on each passenger will be permitted on a lorry. If waiting for the bus less than four, then replace the truck, without waiting for the lorry to allow passenger embarkation. Try to write a simulated crossing management. Algorithm design : a bus and the truck were established a chain cohort, the initial were empty. Later, a car is not a passenger vehicle is, it can be said of the entire process event-driven event is the two, said a passenger, said the lorry 0. Two ships have not yet arrived at the bus and the truck were ranked
Date : 2025-12-17 Size : 2kb User : 西们子
[Data structs] pause_fly DL : 0: 一个自己设计的简单停车场管理系统。里面有实验报告。希望你们喜欢。-a simple design their own car park management system. There are experimental report. Hope you like.
Date : 2025-12-17 Size : 98kb User : fly
[Data structs] chinahorse DL : 0: 如果車不動,請設計算法:按馬走日的方法但又不能被車吃掉,用回溯法設計馬的走法,並打印出路程.可以做為軟體設計的參考-If the car does not move, please algorithm design : taking Japan by Ma but the car can not be eaten, Design Retrospective with a horse walk, and print out distance. can be used as a reference design software
Date : 2025-12-17 Size : 3kb User :
[Data structs] Thecarstop DL : 0: 停车场是一条可以停放n辆车的狭窄通道，且只有一个大门汽车停放安到达时间的先后依次由北向南排列（大门在最南端，最先到达的第一辆车停在最北端）若停车场已经停满n辆车，后来的汽车在便道上等候，一旦有车开走，排在便道上的第一辆车可以开入；当停车场的某辆车要离开时，停在他后面的车要先后退为他让路，等它开出后其他车在按照原次序开入车场，每两停在车场的车要安时间长短缴费。要求：以栈模拟停车场，以队列车场外的便道，按照从终端输入的数据序列进行模拟管理。每一组数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码、以及到达或离去的时刻。对每一组数据进行操作后的信息为：若是车辆到达，则输出汽车在停车场的内或便道上的位置：若是车辆离去则输出汽车在停车场内的停留时间和应缴纳的费用（在便道上的停留时间不收费）。栈以顺序结构实现，队列以链表结构实现。 -parking can be a n vehicles parked in a narrow channel. and only one door car parked on the time of arrival has followed from north to south with (the southernmost tip of the door, the first to reach No. 1 car was parked in the most northern end of the project) if the car park has been full of parked cars n, and later in the car on the sidewalk waiting Once a car drive away, on the sidewalk on the first one into the car; When parking a car to leave, He stopped at the first car behind the back of his crazy, it has come out after the other vehicles in the original order into the garage, Every two parked cars in the parking lots to pay security duration. Requirements : Stack simulated car parks, to train teams outside the sidewalk, according to the input from the terminal sequence simulation
Date : 2025-12-17 Size : 3kb User : 牛纪超
[Data structs] part DL : 0: 停车场程序，当有车进入停车场是，如果停车场内有位置，则记录停入时间，车牌号，车位，若没有停车位，则让其在便道上等待，当有车离开时，则记录离开时间，然后算出应付费用，让等待的车进入停车场-Parking lot procedures, when a car entered the parking lot is that if the location of car parks have, then stop into the record time, license plate number, parking spaces, if there are no parking spaces are allowed in the sidewalk waiting for, when a car left, then Records time of departure, and then calculate the fees payable, so that cars waiting to enter the car park
Date : 2025-12-17 Size : 2kb User : 陈虹雨
[Data structs] car-parking DL : 0: 该程序主要实现停车场的模拟管理。总共使用了一个队列俩个堆栈。其中一个堆栈用来描述停车场，另一个堆栈是一个临时堆栈，用于存放从停车场出场的汽车。队列用于存放在便道等候入场停车的车辆。-this program mainly used for simulating car-parking.there are two stacks and a queue.the first stack used for the park,the second is used to park cars for temporary.the queue is used for park the cars which are waiting for parking.
Date : 2025-12-17 Size : 182kb User :
[Data structs] tcc DL : 0: 以栈模拟停车场，以队列模拟车场外的便道。每一组输入数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码以及到达或离去的时刻。对每一组输入数据进行操作后的输出信息为：若是车辆到达，则输出汽车在停车场内或便道上的停车位置；若是车辆离去，则输出汽车在停车场内停留的时间和应交纳的费用（在便道上停车不收费）。栈以顺序存储结构实现，队列以链表结构实现。-Simulation of the car park to the stack to queue outside the road vehicle simulation. Input data for each group of three data items: auto " to" or " leave" information, vehicle license number and time of arrival or departure. Input data for each group to operate the output after the message is: If the arrival of the vehicles, while exports of motor vehicles in the parking lot or parking spaces on the sidewalk if the vehicle left, the output of motor vehicles in the parking lot to stay within time and should be paid The cost (in the pavement on the parking, no charge). Stack storage structure in order to achieve, a linked list queue structure.
Date : 2025-12-17 Size : 1kb User : XH
[Data structs] car DL : 0: 算法分析中的经典问题之动态规划法汽车加油问题，应用VC++编写的C源码-Algorithm analysis of the classic problems of the dynamic programming vehicle refueling, the application VC++ source code written in C
Date : 2025-12-17 Size : 164kb User : 感飞
[Data structs] car DL : 0: 问题描述：设停车场是一个可停放n辆汽车的狭长通道，且只有一个大门可供汽车进出。汽车在停车场内按车辆到达时间的先后顺序，依次由北向南排列（大门在最南端，最先到达的第一辆车停放在停车场的最北端），若停车场内已停满n辆汽车，则后来的汽车只能在门外的便道上等候，一旦有车开走，则排在便道上的第一辆车即可开入；当停车场内某辆车要离开时，在它之后进入的车辆必须先退出车场为它让路，待该辆车开出大门外，其他车辆再按原次序进入车场，每辆停放在车场的车在它离开停车场时必须按它停留的时间长短交纳费用。试为停车场编制按上述要求进行管理的模拟程序。基本要求以栈模拟停车场，以队列模拟车场外的便道，按照从终端读入的输入数据序列进行模拟管理。每一组输入数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码以及到达或离去的时刻。对每一组输入数据进行操作后的输出信息为：若是车辆到达，则输出汽车在停车场内或便道上的停车位置；若是车辆离去，则输出汽车在停车场内停留的时间和应交纳的费用（在便道上停留的时间不收费）。栈以顺序结构实现，队列以链表结构实现。 -The C/C++ program code is about mangment the car system.
Date : 2025-12-17 Size : 2kb User : baizhanning
[Data structs] car DL : 0: 设有一个可以停放n辆汽车的狭长停车场，它只有一个大门可以供车辆进出。车辆到达停车场时间的早晚依次从停车场最里面向大门口处停放（最先到达的第一辆车放在停车场最里面）。如果停车场已放满n辆车，则后来的车辆只能停在停车场大门外的便道上等待，一旦停车场里有车开走，则排在便道上的第一辆车就进入停车场。若停车场内有某辆车要开走，在它之后进入停车场的车都必须先退出停车场，为它让路，待其开出停车场后，这些车再依原来的次序进场。每辆车离开停车场时，都应根据其在停车场的逗留时间交费。如果停留在便道上的车未进停车场就要离去，允许其离去，不收停车费，并且仍然保持在便道上等待的车辆顺序。编制一程序模拟停车场的管理 -There is a park n vehicles can be long and narrow parking lot, it has only one door can be used for vehicle access. Vehicles to arrive sooner or later turn from the parking lot of time inside the car park entrance at the park (the first to reach the first car on the parking lot the inside). If the parking lot is filled with n vehicles, the vehicle was only parked in the parking lot waiting on the sidewalk outside the gate, once the parking lot where a car drove off, came in the first car on the sidewalk to enter the parking lot . If there is a car parking lot to drive away, into the parking lot in the car after it must first leave the parking lot, to make way for it, let it out of the carpark, the car then follow the original order entry. Vehicle leaving the parking lot, should be based on their length of stay in the parking lot fee. If you stay in the car on the sidewalk into the parking lot will not leave, allowing it to leave, do not charge parking fees, and still maintain the order
Date : 2025-12-17 Size : 2kb User : lxc
[Data structs] car DL : 0: 停车场管理系统 c语言实现停车场拥有M个车位和一条进入停车场的便道，便道上最多停放N辆汽车。汽车要想进入车位，首先进入便道等候。若有空闲车位，则停车入位，否则在便道继续等候，直至有车位空出。若便道已经停满等候的汽车，后到达的汽车只能离开，选择其他停车场。设计一个停车场管理系统，模拟停车场的运作，并统计停车场的收入。-Parking Management System with M c language parking spaces and a sidewalk into the parking lot, parked up on the sidewalk N cars. To enter the car parking spaces, first into the pavement waiting. If free parking, the parking into place, or in the sidewalk to wait until the needed spot. If the sidewalk is already full of parked cars waiting, after the arrival of the vehicle to leave, choose a parking lot. Designing a car park management systems, simulation parking operations and parking revenue statistics.
Date : 2025-12-17 Size : 2kb User : Michelle
[Data structs] car-park-management-system DL : 0: 用栈和队列实现的一个小型停车场管理系统，主要考察数据结构！-It uses stack and queue implementations with a small car park management system, mainly on data structures!
Date : 2025-12-17 Size : 1.07mb User : 邓名仲
[Data structs] CAR DL : 0: some problems about c++.(car.cpp)
Date : 2025-12-17 Size : 185kb User : longman

« 12 3 4 5 6 7 8 9 10 »