Please help!!!

Use a single subscribed array to solve the following

problem. Read in 20 numbers, each of which is between

10 and 100, inclusive. As each number is read, print

it only if it is not a duplicate of a number already

read. Provide for the "worst case" in which all 20

numbers are different. Use the smallest possible array

to solve this problem.