There is a ".c"-file with attached txt documents (Movie.txt and Ticket.txt)
Code is written in C language, cause I decided that C is more closer to me than C++. But C++ is more preferrable for this task, cause OOP is more implementable with this language. Considering deadline I decided to complete in manner of "Done is better than perfect".
It has to be compiled first and then run.
Check before that your sample files in the same directory with simul.c and then if your OS is Linux run "gcc simul.c -o test" and then run "./test". On Windows first run "gcc simul.c" then "simul".
Workflow explanation:
- Reading attachedfiles and storing the data from them in local variables
- Computing the maximum number of tamesteps (start time + duration of last movie)
- Itterate timesteps and in each itteration check is there request for tickets
- Checking is requested movie not started yet
- Checking is available places more then requested places
- Placing customers in the case request is proceed all checkings
- In every itteration print to the terminal current status of movies and halls. Printing places status for the coming movies.
- At the end check how many people missed the chanse to watch the movie
Features which is done in the code:
- Created structs to map tickets, movies and halls with each other
- Every created struct variables contains their identifications and status
- Assumed that movies which will be played in the same hall will not overcome each other
- max number of movies is 10 (can be changed in code to dynamic from static)
- max number of requests for tickets is 100 (can be changed in code to dynamic from static)