#4299. 「一本通 1.3 例 4」Addition Chains

「一本通 1.3 例 4」Addition Chains

[{"sectionTitle":"题目描述","type":"Text","text":"原题来自:ZOJ 1937\r\n\r\n已知一个数列 a0,a1...ama_0,a_1...a_m(其中 $a_0 = 1 , a_m = n , a_0 \\lt a_1 \\lt a_2 \\lt ... \\lt a_{m-1} \\lt a_m$)。对于每个 kk,需要满足 ak=ai+aja_k=a_i+a_j0leqi,jleqk10 \\leq i , j \\leq k-1,这里 iijj 可以相等)。\r\n\r\n现给定 nn 的值,要求 mm 的最小值(并不要求输出),及这个数列每一项的值(可能存在多个数列,只输出任一个满足条件的就可以了)。","subType":"markdown"},{"sectionTitle":"输入格式","type":"Text","text":"多组数据,每行给定一个正整数 nn 。\r\n\r\n输入以 00 结束。","subType":"markdown"},{"sectionTitle":"输出格式","type":"Text","text":"对于每组数据,输出满足条件的长度最小的数列。","subType":"markdown"},{"sectionTitle":"样例","type":"Sample","text":"","subType":"markdown","payload":["5\n7\n12\n15\n77\n0","1 2 4 5\n1 2 4 6 7\n1 2 4 8 12\n1 2 4 5 10 15\n1 2 4 8 9 17 34 68 77"]},{"sectionTitle":"数据范围与提示","type":"Text","text":"1leqnleq100,1leqkleqm1 \\leq n \\leq 100,1 \\leq k \\leq m","subType":"markdown"}]