1 solutions
-
0
C++ :
#include<stdio.h> #include<algorithm> #include<string.h> using namespace std; int main() { int v,n; int a[25]; long long d[10001]; while(scanf("%d%d",&v,&n)!=EOF) { for(int i=0;i<v;i++) scanf("%d",&a[i]); sort(a,a+v); memset(d,0,sizeof(d)); d[0]=1; for(int i=0;i<v;i++) for(int j=a[i];j<=n;j++) d[j]+=d[j-a[i]]; printf("%lld\n", d[n]); } return 0; }
- 1
Information
- ID
- 16497
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By