Design an IPO chart and a C$++$ source file that solves the problem below.

Problem Statement

The Greedy Ring Manufacturing Company makes an item called a doflingy. The shipping clerk is faced with the following problem. Doflingies are very delicate and must be shipped in special, very expensive containers. The containers are available in $4$ sizes: Huge, Large, Medium, and Small. Each container holds the following quantity of doflingies:

Huge containers hold $50$ doflingies

Large containers hold $20$ doflingies

Medium containers hold $5$ doflingies

Small containers hold $1$ doflingy

The company needs a program that takes in the number of doflingies to be shipped and displays the number of huge, medium, large, and small containers needed to send the shipment in the minimum number of containers.

In your solution, ask the user for the number of doflingies needed to be shipped.

Then, calculate the number of huge, medium, large and small containers using a combination of sequential division and modular division calculations.

Afterwards, display the number of each container needed.

For example, if the user enters $76$ doflingies to be shipped, the output would have $1$ Huge Container, $1$ Large Container, $1$ Medium Container, and $1$ Small Container.

Model the logic in an IPO Chart, then create the logic in a C$++$ source file that is well documented with comments.