Reference no: EM132432027

In this activity, you will be given a series of programming problems you will commonly encounter in novice programming competitions. You are to (a) list down Technical Work Items, (b) create a visualization of your work items using Flowcharts, and (c) compose Pseudocodes that represents your flowcharts. Keep your answers as simple as possible without compromising on the logical aspect of your identified solution.

• On the first page of your solution, list down the Technical Work Items you identified that would help to eventually solve the problems provided.
• On the second page, draft a flowchart representation of your solution. Use your listed Technical Work Items as your guide. Be sure to adhere to our set of guidelines as discussed in Module002.
• You may use additional papers if needed.
• On the last page of your solution, write a translation of your flowcharts to pseudocodes.

QUESTION 1:Write a program that accepts an integer input from the user and display the least number of combinations of 200s, 100s, 50s, 20s, 10s, 5s, and 1s.

[Test your solution using this samples]

• Input: 250

Output: 1x200s, 1x50s

• Input: 1127

Output: 5x200s, 1x100s, 1x20s, 1x5s, 2x1s

• Input: 1127

Output: 5x200s, 1x100s, 1x20s, 1x5s, 2x1s

• Input: 19

Output: 1x10s, 1x5s, 4x1s

[Hints]

• Use division to determine the number of occurrence of each element (i.e. 200, 100) in the input (e.g. Given 500 if we divide it by the largest number possible; which is 200; we will get 2. Therefore, there are 2x200s.)
• Use subtraction to determine the remaining value of the input. (e.g. In the 500 example, since there are 2x200s, we still have 100 to process. The 100 came from 500 - (2*200) = 100.)
• Use the next largest number possible (i.e. 100) to check the number of occurrence. Continue until the remaining value of the input is zero.