## Welcome To SDIBT ACM-ICPC Online Judge

VIRTUAL JUDGE Recent Contest F.A.Qs Discuss Home ProblemSet Status Ranklist 19 Contest LoginRegister Exam
2017 ACM 集训队预选排名~      报名入口

Problem 1060. -- Self-describing Sequence

## Self-describing Sequence

Time Limit: 1 Sec  Memory Limit: 64 MB
Submit: 16  Solved: 2
[Submit][Status][Discuss]

## Description

Self-describing Sequence Solomon Golomb's self-describing sequence {f (1), f (2), f (3),...} is the only non-decreasing sequence of positive integers with the property that it contains exactly f (k) occurrences of k for each k. A few moment's thought reveals that the sequence must begin as follows: n 1 2 3 4 5 6 7 8 9 10 11 12 f (n) 1 2 2 3 3 4 4 4 5 5 5 6 In this problem you are expected to write a program that calculates the value of f (n) given the value of n.

## Input

The input may contain multiple test cases. Each test case occupies a separate line and contains an integer n ( 1<=n<=2, 000, 000, 000). The input terminates with a test case containing a value 0 for n and this case must not be processed.

## Output

For each test case in the input, output the value of f (n) on a separate line

```100
9999
123456
1000000000
0

```

```21
356
1684
438744

```

## Source

[Submit][Status][Discuss]

HOME Back

한국어 中文 English
All Copyright Reserved 2008-2010 SDIBT TEAM
GPL2.0 2003-2010 HUSTOJ Project TEAM