编程介的小学生 2017-02-17 16:14 采纳率: 20.5%
浏览 958
已采纳

Index of Prime

Let P1, P2, P3....be a sequence of prime numbers. Index of prime for number is 0 iff it is impossible to present it as a sum of few (maybe one) prime numbers, and if such presentation exists, index is equal to minimal number of items in such presentation. Your task is to find index of prime for given numbers and find optimal presentation as a sum of primes.

Input

There are several test cases. Each test case contains a number which is not more than 10000 in a line.

Output

For each test case, first output the index I for the corresponding given number in a line and then write I prime numbers that are items in optimal presentation for the given number. Write these I numbers in order of non-increasing. If there is a tie, output the one in order of smallest dictionary order.

Sample Input

6

Sample Output

2
3 3

  • 写回答

2条回答 默认 最新

  • threenewbee 2017-02-22 14:18
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
查看更多回答(1条)

报告相同问题?

悬赏问题

  • ¥15 HFSS 中的 H 场图与 MATLAB 中绘制的 B1 场 部分对应不上
  • ¥15 如何在scanpy上做差异基因和通路富集?
  • ¥20 关于#硬件工程#的问题,请各位专家解答!
  • ¥15 关于#matlab#的问题:期望的系统闭环传递函数为G(s)=wn^2/s^2+2¢wn+wn^2阻尼系数¢=0.707,使系统具有较小的超调量
  • ¥15 FLUENT如何实现在堆积颗粒的上表面加载高斯热源
  • ¥30 截图中的mathematics程序转换成matlab
  • ¥15 动力学代码报错,维度不匹配
  • ¥15 Power query添加列问题
  • ¥50 Kubernetes&Fission&Eleasticsearch
  • ¥15 報錯:Person is not mapped,如何解決?