Cod sursa(job #585733)
Utilizator | Antoanela Siminiuc antoanela | Data | 30 aprilie 2011 11:30:10 |
---|---|---|---|
Problema | NumMst | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Algoritmiada 2011, Runda Finală, Clasele 10-12 | Marime | 0.61 kb |
#include <cstdio>
int n, d, v[10000], h;
int main()
{
freopen("nummst.in","r",stdin);
freopen("nummst.out","w",stdout);
scanf("%d",&n);
int i, c, k, s;
for (i=2; i*i<=n; i++)
if (!(n%i))
{
d=i;
break;
}
s=d;
d=n/d;
if (s==2)
{
h=2;
v[1]=v[2]=1;
} else
{
c=2;
for (k=0; k+c<=s; )
{
v[++h]=c;
k+=c;
}
c=s-k;
for (i=1; i<=c; i++) v[++h]=1;
}
for (i=1; i<=h; i++) printf("%d ", v[i]*d);
return 0;
}