Problem 2: Postman Harry Harry is a postman. He's got a post office with a size of n rows office contains a number of letters. Harry can only go right anc at (n-1, m-1). Write a program that calculates the maximum an can only pick up letters from a slot if he is on that slot. If the a and right, go right. Sample input/output: Enter the number of rows and columns: 35 Enter the number of letters in the 5 slots of row number 1:5 260: Enter the number of letters in the 5 slots of row number 2: 2 4392 Enter the number of letters in the 5 slots of row number 3: 872 3. The maximum number of letters Harry can pick is 32

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%
Problem 2: Postman Harry
Harry is a postman. He's got a post office with a size of n rows and m columns. Each slot at the post
office contains a number of letters. Harry can only go right and down. He starts at (0, 0), and ends
at (n-1, m-1). Write a program that calculates the maximum amount of letters Harry can pick up. He
can only pick up letters from a slot if he is on that slot. If the amount of letters is the same down
and right, go right.
Sample input/output:
Enter the number of rows and columns: 35
Enter the number of letters in the 5 slots of row number 1: 5 2 60 1
Enter the number of letters in the 5 slots of row number 2: 2 4 3 9 2
Enter the number of letters in the 5 slots of row number 3: 8 72 3 4
The maximum number of letters Harry can pick is 32
solve using c++; (chapter 9: Variables /
Assignments)
Transcribed Image Text:Problem 2: Postman Harry Harry is a postman. He's got a post office with a size of n rows and m columns. Each slot at the post office contains a number of letters. Harry can only go right and down. He starts at (0, 0), and ends at (n-1, m-1). Write a program that calculates the maximum amount of letters Harry can pick up. He can only pick up letters from a slot if he is on that slot. If the amount of letters is the same down and right, go right. Sample input/output: Enter the number of rows and columns: 35 Enter the number of letters in the 5 slots of row number 1: 5 2 60 1 Enter the number of letters in the 5 slots of row number 2: 2 4 3 9 2 Enter the number of letters in the 5 slots of row number 3: 8 72 3 4 The maximum number of letters Harry can pick is 32 solve using c++; (chapter 9: Variables / Assignments)
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Arrays
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.
Similar questions
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