his dream workplace with N-1 of his friends! Like any dream workplace, this a ons. To ensure absolute happiness of the employees, there are the following er works on exactly one day! You heard it right: no more, no less. ay, at most one worker may work. This provides the perfect work conditions: nd you. ker has a deadline; let's denote the deadline of the i-th worker by di. (This mea ich the i-th worker works must not be later than day di: the days are numbere

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
icon
Related questions
Question
100%

Computer science  Cs 102

Brian is working at his dream workplace with N-1 of his friends! Like any dream workplace, this one also has
dream work conditions. To ensure absolute happiness of the employees, there are the following rules at the
company:
Each worker works on exactly one day! You heard it right: no more, no less.
On each day, at most one worker may work. This provides the perfect work conditions: no crowd, just
the work and you.
Every worker has a deadline; let's denote the deadline of the i-th worker by di. (This means that the
day on which the i-th worker works must not be later than day di; the days are numbered starting
from 1.) You thought there weren't any limitations, eh?
However, sooner or later, all dream workplaces have to fall. The CLO (Brianland Labour Office) demands that
there should be exactly C ways to schedule the work such that the above conditions are fulfilled. Two
scheduling's are different if there is an employee that works at different days in these scheduling.
Brian is asking for your help, since he can't spare any workdays at this company. You should find a sequence of
employees' deadlines d1<d2ssdN such that there are exactly C ways to schedule the work. If there are
multiple sequences satisfying this condition, do another little favour for Brian: minimise dN (his deadline).
Develop a C++ program for the above problem.
Input
The first line of the input contains a single integer T denoting the number of test cases. The
description of T test cases follows.
• The first and only line of each test case contains two space-separated integers N and C.
Sample Input:
1
3 10
Output:
137
Transcribed Image Text:Brian is working at his dream workplace with N-1 of his friends! Like any dream workplace, this one also has dream work conditions. To ensure absolute happiness of the employees, there are the following rules at the company: Each worker works on exactly one day! You heard it right: no more, no less. On each day, at most one worker may work. This provides the perfect work conditions: no crowd, just the work and you. Every worker has a deadline; let's denote the deadline of the i-th worker by di. (This means that the day on which the i-th worker works must not be later than day di; the days are numbered starting from 1.) You thought there weren't any limitations, eh? However, sooner or later, all dream workplaces have to fall. The CLO (Brianland Labour Office) demands that there should be exactly C ways to schedule the work such that the above conditions are fulfilled. Two scheduling's are different if there is an employee that works at different days in these scheduling. Brian is asking for your help, since he can't spare any workdays at this company. You should find a sequence of employees' deadlines d1<d2ssdN such that there are exactly C ways to schedule the work. If there are multiple sequences satisfying this condition, do another little favour for Brian: minimise dN (his deadline). Develop a C++ program for the above problem. Input The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. • The first and only line of each test case contains two space-separated integers N and C. Sample Input: 1 3 10 Output: 137
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Introduction to computer system
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education