Pagini recente » Cod sursa (job #2918152) | Cod sursa (job #293799) | Cod sursa (job #586913) | Cod sursa (job #2304517) | Cod sursa (job #204921)
Cod sursa(job #204921)
#include<fstream.h>
int n;
long a[1001],m[1001],min;
char v[1001];
ofstream fout("economie.out");
void citire()
{
ifstream fin("economie.in");
int i;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
fin.close();
}
int divide(int p, int q)
{
int st,dr,x;
st=p, dr=q, x=a[p];
while(st<dr)
{
while(st<dr && a[dr]>=x) dr--;
a[st]=a[dr];
while(st<dr && a[st]<=x) st++;
a[dr]=a[st];
}
a[st]=x;
return st;
}
void ord(int p, int q)
{
int mij;
mij=divide(p,q);
if(mij-1>p) ord(p,mij-1);
if(mij+1<q) ord(mij+1,q);
}
void afis()
{
int i;
fout<<min<<'\n';
for(i=1;i<=min;i++)
fout<<m[i]<<'\n';
fout.close();
}
void numara()
{
int i,j;
if(a[1]==1)
{
fout<<"1"<<'\n';
fout<<"1"<<'\n';
fout.close();
}
else
{
m[++min]=a[1];
v[1]=1;
for(i=2;i<=n;i++)
{
for(j=1;j<=min;j++)
if(!v[i] && a[i]%m[j]==0) v[i]=1;
if(!v[i])
v[i]=1, m[++min]=a[i];
}
afis();
}
}
int main()
{
citire();
ord(1,n);
numara();
return 0;
}