Informatika - 2021./22. jesen - 12.

$\begin{array}{rlr}{\displaystyle }& {\displaystyle amp;\text{for i in range(1, n + 1): }}& {\displaystyle amp;\begin{array}{rlr}{\displaystyle }& {\displaystyle amp;\text{if n \% i == 0: }}& {\displaystyle amp;\text{print(n)}}\end{array}}\end{array}\backslash begin\{aligned\}\; \&\; \backslash text\{for\; i\; in\; range(1,\; n\; +\; 1):\}\; \backslash \; \&\; \backslash qquad\; \backslash begin\{aligned\}\; \&\; \backslash text\{if\; n\; \backslash \%\; i\; ==\; 0:\}\; \backslash \; \&\; \backslash qquad\; \backslash qquad\; \backslash text\{print(n)\}\; \backslash end\{aligned\}\; \backslash end\{aligned\}$

\begin{aligned} & \text{int n;} \ & \text{for (int i=1; i<n+1; i++)} \ & \qquad \text{if (n \% i == 0)} \ & \qquad \qquad \text{printf("\%d", n);} \end{aligned}

$\begin{array}{rlr}{\displaystyle }& {\displaystyle amp;\text{for i in range(2, n + 1): }}& {\displaystyle amp;\begin{array}{rlr}{\displaystyle }& {\displaystyle amp;\text{if n \% i == 0: }}& {\displaystyle amp;\text{print(i)}}\end{array}}\end{array}\backslash begin\{aligned\}\; \&\; \backslash text\{for\; i\; in\; range(2,\; n\; +\; 1):\}\; \backslash \; \&\; \backslash qquad\; \backslash begin\{aligned\}\; \&\; \backslash text\{if\; n\; \backslash \%\; i\; ==\; 0:\}\; \backslash \; \&\; \backslash qquad\; \backslash qquad\; \backslash text\{print(i)\}\; \backslash end\{aligned\}\; \backslash end\{aligned\}$

\begin{aligned} & \text{int n;} \ & \text{for (int i=2; i<n+1; i++)} \ & \qquad \text{if (n \% i == 0)} \ & \qquad \qquad \text{printf("\%d", i);} \end{aligned}

$\begin{array}{rlrl}{\displaystyle }& {\displaystyle amp;\text{for i in range(2, round(n**0.5) + 1): }}& {\displaystyle amp;\begin{array}{rlr}{\displaystyle }& {\displaystyle amp;\text{if n \% i == 0: }}& {\displaystyle amp;\text{print(i)}}\end{array}}& {\displaystyle amp;\text{print(n)}}\end{array}\backslash begin\{aligned\}\; \&\; \backslash text\{for\; i\; in\; range(2,\; round(n**0.5)\; +\; 1):\}\; \backslash \; \&\; \backslash qquad\; \backslash begin\{aligned\}\; \&\; \backslash text\{if\; n\; \backslash \%\; i\; ==\; 0:\}\; \backslash \; \&\; \backslash qquad\; \backslash qquad\; \backslash text\{print(i)\}\; \backslash end\{aligned\}\; \backslash \; \&\; \backslash text\{print(n)\}\; \backslash end\{aligned\}$

\begin{aligned} & \text{int n;} \ & \text{for (int i=2; i<round(sqrt(n))+1; i++)} \ & \qquad \text{if (n \% i == 0)} \ & \qquad \qquad \text{printf("\%d", i);} \ & \text{printf("\%d", n);} \end{aligned}

$\begin{array}{rlrl}{\displaystyle }& {\displaystyle amp;\text{for i in range(1, n // 2 + 1): }}& {\displaystyle amp;\begin{array}{rlr}{\displaystyle }& {\displaystyle amp;\text{if n \% i == 0: }}& {\displaystyle amp;\text{print(i)}}\end{array}}& {\displaystyle amp;\text{print(n)}}\end{array}\backslash begin\{aligned\}\; \&\; \backslash text\{for\; i\; in\; range(1,\; n\; //\; 2\; +\; 1):\}\; \backslash \; \&\; \backslash qquad\; \backslash begin\{aligned\}\; \&\; \backslash text\{if\; n\; \backslash \%\; i\; ==\; 0:\}\; \backslash \; \&\; \backslash qquad\; \backslash qquad\; \backslash text\{print(i)\}\; \backslash end\{aligned\}\; \backslash \; \&\; \backslash text\{print(n)\}\; \backslash end\{aligned\}$

\begin{aligned} & \text{int n;} \ & \text{for (int i=1; i<n/2+1; i++)} \ & \qquad \text{if (n \% i == 0)} \ & \qquad \qquad \text{printf("\%d", i);} \ & \text{printf("\%d", n);} \end{aligned}