EratosthenSieve2 | Topcoder Archive

Problem Statement

Let N₁ = {1, 2, 3, 4, 5, ..., 1000} (the set of all positive integers between 1 and 1000, inclusive).

Delete every second number in N₁. The result is N₂ = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, ..., 999}.

Delete every third number in N₂. The result is N₃ = {1, 3, 7, 9, 13, 15, 19, 21, 25, ..., 999}.

Delete every fourth number in N₃. The result is N₄ = {1, 3, 7, 13, 15, 19, 25, 27, ...}.

...

Delete every tenth number in N₉. The result is N₁₀. Find and return the n-th element of sequence N₁₀, where n is a 1-based index.

Definition

Class:: EratosthenSieve2
Method:: nthElement
Parameters:: int
Returns:: int
Method signature:: int nthElement(int n)
(be sure your method is public)

Notes

N10 will contain exactly 101 elements.

Constraints

n will be between 1 and 100, inclusive.

Examples

```
3
```
```
Returns: 7
```
```
1
```
```
Returns: 1
```
```
10
```
```
Returns: 79
```
```
25
```
```
Returns: 223
```

This problem statement is the exclusive and proprietary property of Topcoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of Topcoder, Inc. is strictly prohibited. (c)2024, Topcoder, Inc. All rights reserved.