CF1854E.Game Bundles
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Rishi is developing games in the 2D metaverse and wants to offer game bundles to his customers. Each game has an associated enjoyment value. A game bundle consists of a subset of games whose total enjoyment value adds up to 60 .
Your task is to choose k games, where 1≤k≤60 , along with their respective enjoyment values a1,a2,…,ak , in such a way that exactly m distinct game bundles can be formed.
输入格式
The input is a single integer m ( 1≤m≤1010 ) — the desired number of game bundles.
输出格式
The first line should contain an integer k ( 1≤k≤60 ) — the number of games.
The second line should contain k integers, a1,a2,…,ak ( 1≤a1,a2,…,ak≤60 ) — the enjoyment values of the k games.
输入输出样例
输入#1
4
输出#1
4 20 20 20 20
输入#2
722
输出#2
15 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1
输入#3
1
输出#3
1 60
说明/提示
In the first sample, any subset of size 3 is a game bundle. There are 4 such subsets.