1023. Three powers

单点时限: 2.0 sec

内存限制: 256 MB

Consider the set of all non-negative integer powers of 3.

$S = {1,3,9,27,81, \ldots }$

Consider the sequence of all subsets of $S$ ordered by the value of the sum of their elements. The question is simple: find the set at the $n$-th position in the sequence and print it in increasing order of its elements.

输入格式

Each line of input contains a number $n$, which is a positive integer with no more than $19$ digits. The last line of input contains $0$ and it should not be processed.

输出格式

For each line of input, output a single line displaying the n-th set as described above, in the format used in the sample output.

样例

Input
1
7
14
783
1125900981634049
0
Output
{}
{3,9}
{1,9,27}
{3,9,27,6561,19683}
{59049,3486784401,205891132094649,717897987691852588770249}

22 人解决,53 人已尝试。

24 份提交通过,共有 114 份提交。

6.3 EMB 奖励。

创建: 17 年,9 月前.

修改: 5 年,4 月前.

最后提交: 1 年,3 月前.

来源: Waterloo local 2004

题目标签