Pagini recente » Cod sursa (job #622687) | Cod sursa (job #871986) | Cod sursa (job #3132304) | Cod sursa (job #343960) | Cod sursa (job #3138180)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("economie.in");
ofstream fout("economie.out");
int n, i, a[1001], pr[1001], k, ck, ca;
bool check(int sum)
{
int nrl=sum/pr[1], j=2;
sum%=pr[1];
while(sum && j<=k)
{
nrl=min(nrl, sum/(pr[j]-pr[j-1]));
sum-=nrl*(pr[j]-pr[j-1]);
j++;
}
return !sum;
}
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>a[i];
sort(a+1, a+n+1);
k=1;
pr[1]=a[1];
for(i=2; i<=n; i++)
{
if(check(a[i])==0)
{
pr[++k]=a[i];
}
}
fout<<k<<'\n';
for(i=1; i<=k; i++)
fout<<pr[i]<<'\n';
return 0;
}