Change-making problem
The computational problem of choosing as few coins as possible that add up to a given amount of money
The change-making problem addresses the question of finding the minimum number of coins (of certain denominations) that add up to a given amount of money. It is a special case of the integer knapsack problem, and has applications wider than just currency.
Nº Q3406279 ★
Comum · Saberes
Change-making problem
The computational problem of choosing as few coins as possible that add up to a given amount of money
The change-making problem addresses the question of finding the minimum number of coins (of certain denominations) that add up to a given amount of money. It is a special case of the integer knapsack problem, and has applications wider than just currency.
Último preço
—
Preço mínimo
—
Mediana 7 d
—
Vendas 30 d
0
Faixa 30 d
—
Em circulação
0
Cotação
mediana
mín – máx
vendas
Sem vendas no período
Ver tabela
| Data | mediana | Mín | Máx | vendas |
|---|
Histórico de vendas
- Última venda
- —
- Média 30 d
- —
- Mínima 30 d
- —
- Máxima 30 d
- —
- Vendas 7 d
- 0
- Vendas 30 d
- 0
Ainda sem vendas.
Vendas anônimas: sem comprador nem vendedor. Os números contam só vendas entre jogadores.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
The change-making problem addresses the question of finding the minimum number of coins (of certain denominations) that add up to a given amount of money. It is a special case of the integer knapsack problem, and has applications wider than just currency. It is also the most common variation of the coin change problem, a general case of partition in which, given the available denominations of an infinite set of coins, the objective is to find out the number of possible ways of making change for a specific amount of money, without considering the order of the coins. It is weakly NP-hard, but may be solved optimally in pseudo-polynomial time by dynamic programming.
Texto: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: Nandhp (Public domain) ·
Cartas próximas
-
P versus NP
Problema aberto em ciência da computação
Nº Q746242 ★★★★
Sem ofertas
-
Coin problem
Problem in number theory
Nº Q2295746 ★★
Sem ofertas
-
problema da cobertura de vértices
Set of vertices incident on every edge
Nº Q924362 ★
Sem ofertas
-
Problema do colecionador de cupons
O problema do coletor de cupons
Nº Q1148012 ★★
Sem ofertas
-
Aritmética modular
Nº Q319400 ★★★
Sem ofertas
-
Problema da mochila
Nº Q864457 ★★★
Sem ofertas