Note: Please Answer in C++ Only Mr. Cook is the manager of Code cinemas and after a long break the theatres are open to the public again. To compensate for the loss of revenue due to Covid-19, Mr. Chef wants to maximise profits from each show from now on, while following the guidelines set by the government. The instructions are: If two people are sitting in the same row, there must be at least one free seat between them. If two people are sitting in different rows, there must be at least one completely empty row between them. This means that if there are people sitting in rows i and j where i
Note: Please Answer in C++ Only Mr. Cook is the manager of Code cinemas and after a long break the theatres are open to the public again. To compensate for the loss of revenue due to Covid-19, Mr. Chef wants to maximise profits from each show from now on, while following the guidelines set by the government. The instructions are: If two people are sitting in the same row, there must be at least one free seat between them. If two people are sitting in different rows, there must be at least one completely empty row between them. This means that if there are people sitting in rows i and j where i
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Transcribed Image Text:Note: Please Answer in C++ Only
Mr. Cook is the manager of Code cinemas and after a long break the theatres are
open to the public again. To compensate for the loss of revenue due to Covid-19,
Mr. Chef wants to maximise profits from each show from now on, while following
the guidelines set by the government. The instructions are:
If two people are sitting in the same row, there must be at least one free seat
between them.
If two people are sitting in different rows, there must be at least one completely
empty row between them. This means that if there are people sitting in rows i and j
where i<j, there must be some row k such that i<k<j and no one is sitting in row k.
Given the information about the number of rows and the number of seats in each
row, find the maximum number of tickets that Mr. Chef can sell.
Input
1
15
Output
3
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images
