Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
153501 | 陈家宝 | 简单背包问题 | C++ | Accepted | 100 | 0 MS | 240 KB | 395 | 2024-07-03 13:48:55 |
#include<bits/stdc++.h> using namespace std; int w[33],u[33],s,n; int main(){ cin>>s>>n; for(int i=1;i<=n;i++)cin>>w[i]; for(int i=0;i<(1<<n);i++){ int sum=0; memset(u,0,sizeof(u)); for(int j=1;j<=n;j++) if(1<<j&i){ sum+=w[j]; u[j]=1; } if(sum==s){ for(int j=1;j<=n;j++)if(u[j])cout<<w[j]<<endl; return 0; } } cout<<"Failed!"; return 0; }