TopCoder Statistics - Problem Statement

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
4

Returns: 13
5

Returns: 19
6

Returns: 27
7

Returns: 39
8

Returns: 49
2

Returns: 3
10

Returns: 79
11

Returns: 87
12

Returns: 91
13

Returns: 103
14

Returns: 109
15

Returns: 123
16

Returns: 133
17

Returns: 139
18

Returns: 147
19

Returns: 169
20

Returns: 181
21

Returns: 183
22

Returns: 187
23

Returns: 207
24

Returns: 219
26

Returns: 229
27

Returns: 241
28

Returns: 253
29

Returns: 259
30

Returns: 279
31

Returns: 289
32

Returns: 301
33

Returns: 303
34

Returns: 307
35

Returns: 313
36

Returns: 331
37

Returns: 349
38

Returns: 361
39

Returns: 363
40

Returns: 373
41

Returns: 387
42

Returns: 391
43

Returns: 399
44

Returns: 403
45

Returns: 423
46

Returns: 439
47

Returns: 447
48

Returns: 459
49

Returns: 463
50

Returns: 469
51

Returns: 481
52

Returns: 499
53

Returns: 507
54

Returns: 511
55

Returns: 523
56

Returns: 529
57

Returns: 543
58

Returns: 553
59

Returns: 567
60

Returns: 571
61

Returns: 583
62

Returns: 589
63

Returns: 601
64

Returns: 613
65

Returns: 627
66

Returns: 639
67

Returns: 643
68

Returns: 649
69

Returns: 667
70

Returns: 673
71

Returns: 679
72

Returns: 687
73

Returns: 709
74

Returns: 723
75

Returns: 727
76

Returns: 733
77

Returns: 739
78

Returns: 751
79

Returns: 759
80

Returns: 763
81

Returns: 783
82

Returns: 799
83

Returns: 807
84

Returns: 811
85

Returns: 819
86

Returns: 841
87

Returns: 843
88

Returns: 853
89

Returns: 859
90

Returns: 867
91

Returns: 889
92

Returns: 901
93

Returns: 903
94

Returns: 907
95

Returns: 927
96

Returns: 931
97

Returns: 943
98

Returns: 949
99

Returns: 963
100

Returns: 973
25

Returns: 223
97

Returns: 943
73

Returns: 709
100

Returns: 973
3

Returns: 7
5

Returns: 19

Statistics

Problem Statement for "EratosthenSieve2"

Problem Statement

Definition

Notes

Constraints

Examples