Pagini recente » Cod sursa (job #2406772) | Cod sursa (job #2318314) | Cod sursa (job #1241774) | Cod sursa (job #115249) | Cod sursa (job #585925)
Cod sursa(job #585925)
#include <cstdio>
#define MAX 10000
bool ok;
int P[MAX], n, m, x, i, j;
long long sol;
int main () {
freopen ("nummst.in", "r", stdin);
freopen ("nummst.out", "w", stdout);
scanf ("%d", &n);
for (i = 2; i * i <= n; i++)
if (!P[i]) {
P[ ++P[0] ] = i; if (n % i == 0 && !ok) x = i, ok = 1;
for (j = 2 * i; j * j <= n; j += i)
P[j] = 1;
}
/*m = n; sol = 1;
for (i = 1; i <= P[0] && P[i] * P[i] <= n; i++)
while (m % P[i] == 0) {
if (!ok) {
x = P[i], ok = 1;
m /= P[i];
continue;
}
m /= P[i];
sol *= (long long) P[i];
}
if (m != 1) sol *= m;*/
for (i = 1; i <= x; i++)
printf ("%d ", n / x);
return 0;
}