This is the solution for: Four times a day a car goes from A to D and back with stops B and C. Stops are equidistant. There are three places for passengers. We "sell" tickets. Input is point of departure, destination and time. If there is a nonocupied seat out put is cost of the ride. else output tells, that there are no more seats.
-
Notifications
You must be signed in to change notification settings - Fork 1
vbogaevsky/ticketSeller
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published