Pagini recente » Cod sursa (job #2211270) | Cod sursa (job #1630642) | Cod sursa (job #3237178) | Cod sursa (job #984763) | Cod sursa (job #1233421)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("economie.in");
ofstream g("economie.out");
int v[1001],s[50001],i,x,n,ok,j;
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++){
ok=0;
for(j=1;j<=v[n]-v[i];j++){
if(s[j]==1)
s[j+v[i]]=1;
else
if(j%v[i]==0)
s[j]=1;}
for(j=1;j<=n;j++)
if(s[v[j]]!=1)
ok=1;
if(ok==0){
g<<i;
for(j=1;j<=i;j++)
g<<'\n'<<v[j];
break;}}
return 0;
}