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
1000
Returns: 99440
Maximum return
4
Returns: 10
16
Returns: 100
64
Returns: 1000
256
Returns: 10000
914
Returns: 94104
788
Returns: 90110
343
Returns: 11119
857
Returns: 91141
225
Returns: 9401
89
Returns: 1141
8
Returns: 40
511
Returns: 19999
255
Returns: 9999
63
Returns: 999
15
Returns: 99
129
Returns: 4001
456
Returns: 19040
789
Returns: 90111
101
Returns: 1411
997
Returns: 99411
954
Returns: 94944
49
Returns: 901
74
Returns: 1044
800
Returns: 90400
659
Returns: 44109
291
Returns: 10409
1
Returns: 1
2
Returns: 4
3
Returns: 9
998
Returns: 99414
996
Returns: 99410
999
Returns: 99419
10
Returns: 44
714
Returns: 49044
812
Returns: 90490