Problem Statement
I give my true love presents every day. On day 1, I give her one Type 1 present. On day 2, I give her two Type 2 presents, followed by one Type 1 present. On day 3, I give her three Type 3 presents, followed by two Type 2 presents, followed by one Type 1 present. This pattern continues day after day. Soon I begin to wonder, what type of present will be the 100th present that I give my true love? The 1000th? The 1000000th?
For example, the 10th present that I give my true love is the Type 1 present on day 3.
Write a method that takes an
Definition
- Class:
- TwoTurtledoves
- Method:
- presentType
- Parameters:
- int
- Returns:
- int
- Method signature:
- int presentType(int n)
- (be sure your method is public)
Notes
- Unlike the poseur in the popular Christmas song, I do not stop giving my true love presents after the 12th day.
Constraints
- n is between 1 and 1000000000, inclusive.
Examples
10
Returns: 1
The example above.
12
Returns: 4
The second of four Type 4 presents on Day 4.
399
Returns: 11
123456
Returns: 65
1000000000
Returns: 1704
15
Returns: 3
97
Returns: 7
132
Returns: 8
567
Returns: 15
901
Returns: 12
1500
Returns: 9
2340
Returns: 23
5007
Returns: 30
8102
Returns: 26
13975
Returns: 21
20311
Returns: 32
50273
Returns: 65
97263
Returns: 55
412412
Returns: 117
888888
Returns: 93
1034512
Returns: 86
6972342
Returns: 321
11927654
Returns: 376
24000101
Returns: 484
56562342
Returns: 481
154392485
Returns: 410
334789098
Returns: 627
529834211
Returns: 1155
912120634
Returns: 1525
999999999
Returns: 1704
999800616
Returns: 1
999800617
Returns: 1817
1
Returns: 1
2
Returns: 2
3
Returns: 2
4
Returns: 1
1000000000
Returns: 1704
10
Returns: 1
1
Returns: 1
12
Returns: 4
2323
Returns: 24
4
Returns: 1