menu ZJOJ
account_circle 请登录
home
首页
book
题目
apps
分类
play_circle_outline
状态
assessment
竞赛
assignment
作业
equalizer
排名
assignment_ind
登录
person_add
注册
1539: Jimmy's PN Sack
时间限制:1.000s
内存限制:128MB

题目描述

Jimmy has a prime number Sack that can hold a certain weight of prime numbers, and the weight is equal to the sum of the prime numbers. Due to the limited carrying capacity of the Sack, please help Jimmy calculate the maximum number of prime numbers that this pocket can hold.

输入格式

The weight that a sack can carry

输出格式

Each number occupies one row, output the prime numbers loaded and the number of prime numbers output

样例输入 content_copy

100

样例输出 content_copy

2 
3 
5 
7
11 
13
17 
19
23
9

分类