Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Computer Science Engineering:

Computer Science Engineering:

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

Computer Science Engineering:

Magnus Carlson has N jars of pickle. They are numbered from 1 to N while it jar contains A; units of pickle. Magnus Carlson believes that ith jar should contain at least Bi units of pickle. Unfortunately, it happens that A; is less than B;. To fix this issue Magnus Carlson adds pickle by doing M operations. Each operation is defined by four numbers 1, r, x and y. It means that Magnus Carlson adds x units of pickle to the Ith, x + y units of pickle to the (1+ 1)th jar, x+ 2y units of pickle to the (1 + 2)h ja., x+ (r - 1)y units of pickle to the r* jar. After it, Magnus Carlson would like to know for each jar i when it starts to contain at least B; units of pickle, i.e., the minimal number of adding operation that ith jar contained less than B; units of pickle before it, but then started to contain at least B; units of pickle after the operation was applied. Develop a code strictly using only cstdio and algorithm library in C which output the answer for each jar separated by space. If it already contains enough jam you should output 0 as the answer, in case it doesn't even after all the operations output -1 instead. Have a look at the examples for better understanding: Input Output 5 5 44 21 1203 -1 77477 3 1220 2511 3422
Transcribed Image Text:Magnus Carlson has N jars of pickle. They are numbered from 1 to N while it jar contains A; units of pickle. Magnus Carlson believes that ith jar should contain at least Bi units of pickle. Unfortunately, it happens that A; is less than B;. To fix this issue Magnus Carlson adds pickle by doing M operations. Each operation is defined by four numbers 1, r, x and y. It means that Magnus Carlson adds x units of pickle to the Ith, x + y units of pickle to the (1+ 1)th jar, x+ 2y units of pickle to the (1 + 2)h ja., x+ (r - 1)y units of pickle to the r* jar. After it, Magnus Carlson would like to know for each jar i when it starts to contain at least B; units of pickle, i.e., the minimal number of adding operation that ith jar contained less than B; units of pickle before it, but then started to contain at least B; units of pickle after the operation was applied. Develop a code strictly using only cstdio and algorithm library in C which output the answer for each jar separated by space. If it already contains enough jam you should output 0 as the answer, in case it doesn't even after all the operations output -1 instead. Have a look at the examples for better understanding: Input Output 5 5 44 21 1203 -1 77477 3 1220 2511 3422
Expert Solution
steps

Step by step

Solved in 4 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS