"Bidirectionally multiplied" array

Fri, 22 Jan 2010 00:00:00 +0000

Another small problem before I go to sleep tonight:

There is an array A[N] of N numbers. You have to compose an array Output[N] such that Output[i] will be equal to multiplication of all the elements of A[N] except A[i]. For example Output[0] will be multiplication of A[1] to A[N-1] and Output[1] will be multiplication of A[0] and from A[2] to A[N-1]. Solve it without division operator and in O(n).

Money change problem: Greedy vs. Dyn.Pro.

Sun, 17 Jan 2010 00:00:00 +0000

This is a classical problem of Computer Science: it’s used to study both Greedy and Dynamic Programming algorithmic techniques.

I hate having my pocket full of copper!!! -_-

Definition

Given:

A set of n Denominations D[0…n-1] in ascending order, representing a Monetary Coin System
An money amount A, as input

calculate a solution:

* <strong><code>S[0...n-1]</code></strong>, with <code>0 &lt;= S[i] &lt;= (A/S[i])</code> and <code>0 &lt; i &lt; n-1</code>

where:

* <strong><code>A = Sum<sub>[i=0 -> n-1]</sub> { D[i] * S[i] }</code></strong>

* <strong><code>Min{ Sum<sub>[i=0 -> n-1]</sub> { S[i] } }</code></strong>

In other words

Find the smallest amount of coins to make the given amount.

Problem on Zio Ivan

"Bidirectionally multiplied" array

Money change problem: Greedy vs. Dyn.Pro.

Definition

In other words