mattdemon24444
Eternal Poster
Pa help naman po dito sa mga may mabubuting puso dyan
Problem Description
Krispy Kreme is giving away one free donut for each customer today.
They suspect that some customers are trying to get more than their fair share of donuts by lining up more than once.
Try to find these greedy customers so that Krispy Kreme can give away the sweet, soft and glazed donuts to the rightful owners.
Input
1. The number of customers
Constraints
The value is > 0.
2. The customers
Constraints
The value is within the range: 0 <= customer number <= 500.
Output
The first line will contain a message prompt to input the number of customers. The succeeding lines will contain message prompts to input the customers. The last line list down the customers that appeared more than once, in ascending order. Print "HONEST CUSTOMERS" if there are no duplicating customers.
Enter·the·number·of·customers:·4
Customer·number:·5
Customer·number:·6
Customer·number:·6
Customer·number:·5
Duplicates:·
Customer·#5
Customer·#6
========================================================
TEST CASES
Test Case #1
Test Case #4

Problem Description
Krispy Kreme is giving away one free donut for each customer today.
They suspect that some customers are trying to get more than their fair share of donuts by lining up more than once.
Try to find these greedy customers so that Krispy Kreme can give away the sweet, soft and glazed donuts to the rightful owners.
Input
1. The number of customers
Constraints
The value is > 0.
2. The customers
Constraints
The value is within the range: 0 <= customer number <= 500.
Output
The first line will contain a message prompt to input the number of customers. The succeeding lines will contain message prompts to input the customers. The last line list down the customers that appeared more than once, in ascending order. Print "HONEST CUSTOMERS" if there are no duplicating customers.
Enter·the·number·of·customers:·4
Customer·number:·5
Customer·number:·6
Customer·number:·6
Customer·number:·5
Duplicates:·
Customer·#5
Customer·#6
========================================================
TEST CASES
Test Case #1
Enter the number of customers: 4Customer number: 5Customer number: 6Customer number: 6Customer number: 5Duplicates: Customer #5Customer #6Test Case #2Enter the number of customers: 8Customer number: 6Customer number: 21Customer number: 42Customer number: 33Customer number: 56Customer number: 23Customer number: 12Customer number: 6Duplicates: Customer #6Test Case #3Enter the number of customers: 5Customer number: 5Customer number: 2Customer number: 3Customer number: 10Customer number: 4HONEST CUSTOMERSTest Case #4
Enter the number of customers: 6Customer number: 0Customer number: 1Customer number: 2Customer number: 1Customer number: 2Customer number: 0Duplicates: Customer #0Customer #1Customer #2Test Case #5Enter the number of customers: 7Customer number: 20Customer number: 20Customer number: 21Customer number: 21Customer number: 20Customer number: 500Customer number: 500Duplicates:Customer #20Customer #21Customer #500Test Case #6Enter the number of customers: 3Customer number: 444Customer number: 444Customer number: 444Duplicates:Customer #444