Create a flowchart, pseudocode or actual code for the following problem: you are given an n positive integer. Your task is to pay n forints by using the greedy algorithm. The algorithm is simple: you always need to choose the highest possible currency available. The algorithm must print out the used currencies right after each other. The usable currencies: 1,2,5,10,20,50,100,200,500,1000,2000,5000,10000,20000 Example: n=1479. Output: 1000, 200, 200, 50, 20, 5, 2, 2

Create a flowchart, pseudocode or actual code for the following problem: you are given an n positive integer. Your task is to pay n forints by using the greedy algorithm. The algorithm is simple: you always need to choose the highest possible currency available. The algorithm must print out the used currencies right after each other. The usable currencies: 1,2,5,10,20,50,100,200,500,1000,2000,5000,10000,20000 Example: n=1479. Output: 1000, 200, 200, 50, 20, 5, 2, 2

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

See similar textbooks

Similar questions

The current deficit of Arrakis (a fictional country) is 47000000 grods (a fictional currency). It is estimated that the deficit will increase by 4.5% in each year for the next four years. Write a program that will find the estimated deficit in each of the next four years, rounded to the nearest integer
Given a positive integer 'n', find and return the minimum number of steps that 'n' has to take to get reduced to 1. You can perform any one of the following 3 steps:1.) Subtract 1 from it. (n = n - 1) ,2.) If its divisible by 2, divide by 2.( if n % 2 == 0, then n = n / 2 ) ,3.) If its divisible by 3, divide by 3. (if n % 3 == 0, then n = n / 3 ). Write brute-force recursive solution for this.Input format :The first and the only line of input contains an integer value, 'n'.Output format :Print the minimum number of steps.Constraints :1 <= n <= 200 Time Limit: 1 secSample Input 1 :4Sample Output 1 :2 Explanation of Sample Output 1 :For n = 4Step 1 : n = 4 / 2 = 2Step 2 : n = 2 / 2 = 1 Sample Input 2 :7Sample Output 2 :3Explanation of Sample Output 2 :For n = 7Step 1 : n = 7 - 1 = 6Step 2 : n = 6 / 3 = 2 Step 3 : n = 2 / 2 = 1 SolutionDp///.
Transient PopulationPopulations are affected by the birth and death rate, as well as the number of people who move in and out each year. The birth rate is the percentage increase of the population due to births and the death rate is the percentage decrease of the population due to deaths. Write a program that displays the size of a population for any number of years. The program should ask for the following data: The starting size of a population P The annual birth rate (as a percentage of the population expressed as a fraction in decimal form)B The annual death rate (as a percentage of the population expressed as a fraction in decimal form)D The average annual number of people who have arrived A The average annual number of people who have moved away M The number of years to display nYears Write a function that calculates the size of the population after a year. To calculate the new population after one year, this function should use the formulaN = P + BP - DP + A - Mwhere N is the…
Write a program to determine which multiplication table the user wants.The program should be able to do the following:▪️Ask the user the limit he/she wants.▪️Display the results, and▪️Ask the user either to continue or to end.
In city street grids, intersections are often defined by two integers, counting the position of horizontal and vertical streets (sometimes called streets and avenues). Imagine traveling from position (h₁, ₁) to (h₂, v₂). How many blocks do you traverse? (h₂, v₂) (h₁, v₂) Even though there are many possible routes, the distance only depends on the differences h₂ h₁ and v₂ - ₁. However, you need to take the absolute value because the differences might be negative. Complete the following program that prints the number of blocks traveled, given the origin and destination of the trip (which will change as your code is tested). #include 3 4 using namespace std; 5 6 int main() 7 { 8 9 10 11 12 13 5555555 14 15 16 17 18 19 int h1; int v1; int h2; int v2; cin >> h1; cin >> v1; cin >> h2; cin >> v2; /* Your code goes here */ cout << "Distance: << distance << endl;
4. A primary school is conducting a survey on the popularity of certain colours. Students are asked to vote for any of four choices: red, blue, green, none. If red, blue or green is not the favourite, students vote for 'none'. Write an algorithm to find and print the (i) number of students that voted for EACH of the colours: red, blue green (ii) TOTAL number of students that voted for red, blue or green. Assume that on the day of the survey, 150 students are present. Also assume that all votes are valid.
The area A of a Hemisphere is computed using the following equation. A = 4Tr2 %3D where n=3.14159265 and r is the radius. Write an algorithm (Step 4 of problem solving methodology) that reads a radius r from a user then computes the area A using the above-mentioned formula. The algorithm repeats the same process for five positive radius values. [Hint: use any repetition structure]
I'm running a 5-star restaurant and I can only have the best items on my menu. My menu offers 6 items, each represented by a number from 1-6. If an item on my menu does not sell or does not sell that much compared to others, I must act and replace it with something that sells! Identify which dishes do not sell. If every dish sells, print the set of dishes that were ordered least. Input: A single line containing the dish number that were ordered. Treat as one number. INPUT: 156356231 Output: The list of dishes not ordered in numerical order. If every dish sells, print the set of dishes that were ordered least. Separate each number with a new line. OUTPUT: 4
The square root value of a number x can be estimated using the following mathematical equation: - In(x) Vx = e2 %3D where e=2.718282, and In is the natural logarithm Write an algorithm (Step 4 of problem solving methodology) that reads a positive integer from a user then computes the square root of that integer using the above-mentioned formula. The algorithm repeats the same process for five positive integers. [Hint: use any repetition structure]