Cod sursa(job #585670)
Utilizator | Data | 30 aprilie 2011 10:53:45 | |
---|---|---|---|
Problema | NumMst | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Algoritmiada 2011, Runda Finală, Clasele 10-12 | Marime | 0.33 kb |
#include <stdio.h>
int n,m;
int main()
{
freopen("nummst.in","r",stdin);
freopen("nummst.out","w",stdout);
scanf("%d",&n);
int i;
for (i=2; i*i<=n; i++)
if (n%i==0)
{
m=i;
break ;
}
if (!m)
{
printf("%d\n",n);
return 0;
}
for (i=1; i<=m; i++)
printf("%d ",n/m);
printf("\n");
return 0;
}