Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!


Any help please? Thank you :)

Tan Guan ShenTan Guan Shen Member Posts: 1

Hello I have received this question from my lecturer, however, he is unwilling to teach me how to solve this question. This quiz is long over, however, I just wish to know how to solve it using C++, hope someone could help me along.


Given a non-negative integer n, we wish to list down those missing digits in n and
display them in increasing order.
You are suppose to provide k sets of integers for testing where k must be at least 5
and maximum 10. Data validation is required for k.
The following shows some possible interactions and displays:

Enter number of sets for testing: 55
Enter number of sets for testing: 8
Enter number of sets for testing:
Enter number of sets for testing:

Enter integer 1: 87240
Missing digits: 1 3 5 6 9

Enter integer 2: 0
Missing digits: 1 2 3 4 5 6 7 8 9


Thank you

Sign In or Register to comment.