Skip to content

vbogaevsky/ticketSeller

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 

Repository files navigation

ticketSeller

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.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages