UVA 1213 Sum of Different Primes
2017-08-21 16:08
465 查看
https://vjudge.net/problem/UVA-1213
dp[i][j][k] 前i个质数里选j个和为k的方案数
枚举第i个选不选转移
dp[i][j][k] 前i个质数里选j个和为k的方案数
枚举第i个选不选转移
#include<cstdio> #define N 1121 using namespace std; int cnt,p ,dp[190][190] ; bool v ; int main() { for(int i=2;i<N;i++) { if(!v[i]) { v[i]=true; p[++cnt]=i; } for(int j=1;j<=cnt;j++) { if(i*p[j]>=N) break; v[i*p[j]]=true; if(i%p[j]==0) break; } } for(int i=0;i<=cnt;i++) dp[i][0][0]=1; for(int i=1;i<=cnt;i++) for(int j=1;j<=i;j++) for(int k=1;k<N;k++) { if(k-p[i]>=0 ) dp[i][j][k]+=dp[i-1][j-1][k-p[i]]; dp[i][j][k]+=dp[i-1][j][k]; } int n,k; while(scanf("%d%d",&n,&k)!=EOF) { if(!n) return 0; printf("%d\n",dp[cnt][k] ); } }
相关文章推荐
- UVa1213 - Sum of Different Primes(素数表+DP)
- UVa 1213 - Sum of Different Primes
- UVa1213 Sum of Different Primes
- uva 1213 sum of different primes 01背包(二维)
- UVA 1213 - Sum of Different Primes(递推)
- UVA 1213 Sum of Different Primes(经典dp)
- UVA 1213(p343)----Sum of Different Primes
- [UVa1213]Sum of Different Primes(递推,01背包)
- UVA1213 Sum of Different Primes(素数打表+dp)
- UVa 1213 Sum of Different Primes (DP)
- 1213 - Sum of Different Primes(DP)
- 【01背包方案数】POJ-3132 Sum of Different Primes
- POJ 3132 Sum of Different Primes
- uva 1213 Sum of Different Primes, dp
- POJ 3132 Sum of Different Primes
- Sum of Different Primes
- Sum of Different Primes UVA - 1213
- UVA 1213 Sum of Different Primes
- POJ 3132 Sum of Different Primes 动态规划 DP 0-1背包问题
- zoj 2822 Sum of Different Primes (01背包)