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