Cod sursa(job #585590)
Utilizator | Data | 30 aprilie 2011 09:49:02 | |
---|---|---|---|
Problema | NumMst | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Algoritmiada 2011, Runda Finală, Clasele 10-12 | Marime | 0.36 kb |
#include <cstdio>
int n;
void solve() {
int i = 2;
for (i = 2; i <= n; ++ i)
if (n % i == 0)
break;
for (int p = 1; p <= i; ++ p)
printf("%d ", n / i);
}
int main() {
freopen("nummst.in", "r", stdin);
freopen("nummst.out", "w", stdout);
scanf("%d", &n);
solve();
return 0;
}