\u5f88SB\u7684\u5b8c\u5168\u80cc\u5305\u95ee\u9898\u963f\u3002\u3002\u3002
P.S
\u7531\u4e8e\u6211\u6c99\u8336\u3002\u3002\u7d20\u6570\u5224\u5b9a\u5c45\u7136\u5199\u9519\u4e86\u3002\u3002\u8fd8\u8c03\u4e86\u534a\u5929\u3002\u3002
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
const int maxn=1000;
int Q,Ps[maxn],cnt=0,snt=0;
bool isprime(int p)
{
if(p==2) return true;
if(p%2==0) return false;
for(int i=3,j=9;j<=p;i+=2,j=i*i)
if(p%i==0) return false;
return true;
}
void init()
{
cin>>Q;
cnt=1;
for(int i=3;i<=Q;i++)
if( isprime(i) )
{
cnt++;
if(isprime(cnt))
{
Ps[snt++]=i;
}
}
}
bool G[maxn*10]={0};
int F[maxn*10]={0};
int P[maxn*10]={0};
int DP(int x)
{
if(G[x]) return F[x];
G[x]=true;
for(int i=0;i<snt;i++) if(x>=Ps[i])
if(DP(x-Ps[i])<F[x])
{
F[x]=F[x-Ps[i]];
P[x]=Ps[i];
}
F[x]++;return F[x];
}
bool cmp(const int& x,const int& y)
{ return x>y;}
void print(int x)
{
int ans[maxn],cnt=0;
if(P[x]==0) {return;}
while(x)
{
ans[cnt++]=P[x];
x-=P[x];
}
sort(ans,ans+cnt,cmp);
cout<<ans[0];
for(int i=1;i<cnt;i++)
cout<<" "<<ans[i];
}
int main()
{
init();for(int i=0;i<=Q;i++) F[i]=~0U>>3;
F[0]=0;G[0]=true;
if( DP(Q)>10000 )
{
cout<<0<<endl;
}else
{
cout<<DP(Q)<<endl;
print(Q);
}
} <\/p>\n","protected":false},"excerpt":{"rendered":"
\u5f88SB\u7684\u5b8c\u5168\u80cc\u5305\u95ee\u9898\u963f\u3002\u3002\u3002P.S\u7531\u4e8e\u6211\u6c99\u8336\u3002\u3002\u7d20\u6570\u5224\u5b9a\u5c45\u7136\u5199\u9519\u4e86\u3002\u3002\u8fd8\u8c03\u4e86\u534a\u5929\u3002\u3002#include<iostream>#include<algorithm>#include<string.h>using namespace std;const int maxn=1000;int Q,Ps[maxn],cnt=0,snt=0;bool isprime(int p){if(p==2) return true;if(p%2==0) return false;for(int i=3,j=9;j<=p;i+=2,j=i*i)if(p%i==0) return false;return true;}void init(){cin>>Q;cnt=1;for(int i=3;i<=Q;i++)if( isprime(i) ){cnt++;if(isprime(cnt)){Ps[snt++]=i;}}}bool G[maxn*10]={0};int F[maxn*10]={0};int P[maxn*10]={0};int DP(int x){ if(G[x]) return F[x];G[x]=true;for(int i=0;i<snt;i++) if(x>=Ps[i])if(DP(x-Ps[i])<F[x]){F[x]=F[x-Ps[i]];P[x]=Ps[i];}F[x]++;return F[x];}bool cmp(const int& x,const int& y){ return x>y;}void print(int x){int ans[maxn],cnt=0;if(P[x]==0) {return;}while(x){ans[cnt++]=P[x];x-=P[x];}sort(ans,ans+cnt,cmp);cout<<ans[0];for(int i=1;i<cnt;i++)cout<<" "<<ans[i];}int main(){init();for(int i=0;i<=Q;i++) F[i]=~0U>>3;F[0]=0;G[0]=true;if( DP(Q)>10000 ){cout<<0<<endl;}else{cout<<DP(Q)<<endl;print(Q);}}<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[10],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/652"}],"collection":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=652"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/652\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=652"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=652"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=652"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}