Pagini recente » Cod sursa (job #1838005) | Cod sursa (job #2746898) | Cod sursa (job #1772063) | Cod sursa (job #2236798) | Cod sursa (job #711891)
Cod sursa(job #711891)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("economie.in"); ofstream g("economie.out");
int dp[50005], r[1005], v[1005];
int t, i, j, n, x;
int main(){
f>>n;
for (i=1; i<=n; i++) f>>v[i];
sort(v+1, v+n+1);
for (i=1; i<=n; i++){
x=v[i];
if (dp[x]==0) {
t++;
r[t]=x;
for (j=0; j+x<=50000; j++){
if (dp[j]==1 || j==0) dp[j+x]=1;
}
}
}
g<<t<<"\n";
for (i=1; i<=t; i++) g<<r[i]<<"\n";
}