Problem Statement
You enjoy working with numbers that contain only square digits (namely, 0, 1, 4 and 9). The sequence containing only these digits is 0, 1, 4, 9, 10, 11, 14... Return the n-th term (indexed from 0) in this sequence.
Definition
- Class:
- SquareDigitNumbers
- Method:
- getNumber
- Parameters:
- int
- Returns:
- int
- Method signature:
- int getNumber(int n)
- (be sure your method is public)
Constraints
- n will be between 0 and 1000, inclusive.
Examples
0
Returns: 0
The first square digit number is 0.5
Returns: 11
16
Returns: 100
121
Returns: 1941
123
Returns: 1949