PROGRAMMING:Duplicate Elimination
Use a single-subscripted 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's 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.
### Input Specification:
Input 20 numbers in a line, seperate each by a space.
### Output Specification:
Output numbers without duplicate of numbers. A space between 2 numbers, no space after the last number.
### Sample Input:
```in
55 39 82 75 53 82 10 26 45 81 55 91 26 26 91 60 31 20 36 82
```
### Sample Output:
```out
55 39 82 75 53 10 26 45 81 91 60 31 20 36
```
answer：If there is no answer, please comment
Read in 20 numbers, each of which is between 10 and 100, inclusive. As each number is read, print
it only if it's 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.
### Input Specification:
Input 20 numbers in a line, seperate each by a space.
### Output Specification:
Output numbers without duplicate of numbers. A space between 2 numbers, no space after the last number.
### Sample Input:
```in
55 39 82 75 53 82 10 26 45 81 55 91 26 26 91 60 31 20 36 82
```
### Sample Output:
```out
55 39 82 75 53 10 26 45 81 91 60 31 20 36
```
answer：If there is no answer, please comment