当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5138:CET-6 test

题目描述
Small W will take part in CET-6 test which will be held on December $20^{th}$. In order to pass it he must remember a lot of words.
He remembers the words according to Ebbinghaus memory curve method.
He separates the words into many lists. Every day he picks up a new list, and in the next $1^{st}, 2^{nd}, 4^{th}, 7^{th}, 15^{th}$ day, he reviews this list.
So every day he has many lists to review. However he is so busy, he does not know which list should be reviewed in a certain day. Now he invites you to write a program to tell him which list should to be reviewed in a certain day.
Lists are numbered from 1. For example list 1 should be reviewed in the $2^{nd}, 3^{rd}, 5^{th}, 8^{th}, 16^{th}$ day.
输入解释
Multi test cases (about 100), every case contains an integer n in a single line.
Please process to the end of file.

[Technical Specification]
$2 \leq n \leq 100000$
输出解释
For each n,output the list which should be reviewed in the $n^{th}$ day in ascending order.
输入样例
2
100
输出样例
1
85 93 96 98 99
来自杭电HDUOJ的附加信息
Recommend heyang

该题目是Virtual Judge题目,来自 杭电HDUOJ

题目来源 BestCoder Round #21

源链接: HDU-5138

最后修改于 2020-10-25T23:20:07+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)