Problème
A group of friends splits a restaurant bill. All amounts are in cents to avoid floating point surprises.
- The tip is
tip_percentpercent of the bill, rounded to the nearest cent (exactly half a cent rounds up). - The total is the bill plus the tip.
- Each person pays the total divided by
people, rounded up to a whole cent so the group never pays too little.
Implement tip_calculator(bill_cents, tip_percent, people).
Input
bill_cents: The bill before the tip, in cents.
tip_percent: The tip as a whole percentage.
people: How many people share the total.
Output
Return [tip, total, per_person], all in cents.
Contraintes
0 ≤ bill_cents ≤ 10,000,000
0 ≤ tip_percent ≤ 100
1 ≤ people ≤ 50
Exemples
Entrée :
bill_cents = 4850
tip_percent = 18
people = 3
Sortie attendue :
expected = [873, 5723, 1908]
Entrée :
long long bill_cents = 4850;
long long tip_percent = 18;
long long people = 3;
Sortie attendue :
std::vector<long long> expected = {873, 5723, 1908};
Entrée :
long bill_cents = 4850;
long tip_percent = 18;
long people = 3;
Sortie attendue :
long[] expected = new long[] {873, 5723, 1908};
Explication
18% of 4850 is 873, the total is 5723, and 5723 / 3 = 1907.67 rounds up to 1908: [873, 5723, 1908].
Entrée :
bill_cents = 1250
tip_percent = 15
people = 2
Sortie attendue :
expected = [188, 1438, 719]
Entrée :
long long bill_cents = 1250;
long long tip_percent = 15;
long long people = 2;
Sortie attendue :
std::vector<long long> expected = {188, 1438, 719};
Entrée :
long bill_cents = 1250;
long tip_percent = 15;
long people = 2;
Sortie attendue :
long[] expected = new long[] {188, 1438, 719};
Explication
15% of 1250 is 187.5, which rounds up to 188; the total 1438 splits evenly into 719: [188, 1438, 719].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
bill × percent / 100 is the exact tip; add half of the divisor before dividing to round to nearest.
Indice 2
For rounding a division up, (a + b − 1) / b works with non-negative integers.
Indice 3
Watch for overflow: use 64-bit integers.
Complexité attendue
O(1) time, O(1) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.