distribute-money-to-maximum-children

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an integer <code>money</code> denoting the amount of money (in dollars) that you have and another integer <code>children</code> denoting the number of children that you must distribute the money to.

You have to distribute the money according to the following rules:

<ul>
	<li>All money must be distributed.</li>
	<li>Everyone must receive at least <code>1</code> dollar.</li>
	<li>Nobody receives <code>4</code> dollars.</li>
</ul>

Return the maximum number of children who may receive exactly <code>8</code> dollars if you distribute the money according to the aforementioned rules. If there is no way to distribute the money, return <code>-1</code>.

&nbsp;
Example 1:

<pre>
Input: money = 20, children = 3
Output: 1
Explanation: 
The maximum number of children with 8 dollars will be 1. One of the ways to distribute the money is:
- 8 dollars to the first child.
- 9 dollars to the second child. 
- 3 dollars to the third child.
It can be proven that no distribution exists such that number of children getting 8 dollars is greater than 1.
</pre>

Example 2:

<pre>
Input: money = 16, children = 2
Output: 2
Explanation: Each child can be given 8 dollars.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= money &lt;= 200</code></li>
	<li><code>2 &lt;= children &lt;= 30</code></li>
</ul>

distMoney

Distribute Money to Maximum Children

Distribute Candies to People

distribute-candies-to-people

分糖果 II

Fair Distribution of Cookies

fair-distribution-of-cookies

公平分发饼干

Calculate Money in Leetcode Bank

calculate-money-in-leetcode-bank

计算力扣银行的钱

Greedy

Math

给你一个整数&nbsp;<code>money</code>&nbsp;，表示你总共有的钱数（单位为美元）和另一个整数&nbsp;<code>children</code>&nbsp;，表示你要将钱分配给多少个儿童。

你需要按照如下规则分配：

<ul>
	<li>所有的钱都必须被分配。</li>
	<li>每个儿童至少获得&nbsp;<code>1</code>&nbsp;美元。</li>
	<li>没有人获得 <code>4</code>&nbsp;美元。</li>
</ul>

请你按照上述规则分配金钱，并返回 最多&nbsp;有多少个儿童获得 恰好&nbsp;<code>8</code>&nbsp;美元。如果没有任何分配方案，返回&nbsp;<code>-1</code>&nbsp;。

&nbsp;

示例 1：

<pre>输入：money = 20, children = 3
输出：1
解释：
最多获得 8 美元的儿童数为 1 。一种分配方案为：
- 给第一个儿童分配 8 美元。
- 给第二个儿童分配 9 美元。
- 给第三个儿童分配 3 美元。
没有分配方案能让获得 8 美元的儿童数超过 1 。
</pre>

示例 2：

<pre>输入：money = 16, children = 2
输出：2
解释：每个儿童都可以获得 8 美元。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= money &lt;= 200</code></li>
	<li><code>2 &lt;= children &lt;= 30</code></li>
</ul>