Largest proper divisor of n: Difference between revisions
Content added Content deleted
Alextretyak (talk | contribs) (Added 11l) |
Not a robot (talk | contribs) (Add Modula-2) |
||
Line 1,027: | Line 1,027: | ||
{{out}} |
{{out}} |
||
<pre>{1,1,1,2,1,3,1,4,3,5,1,6,1,7,5,8,1,9,1,10,7,11,1,12,5,13,9,14,1,15,1,16,11,17,7,18,1,19,13,20,1,21,1,22,15,23,1,24,7,25,17,26,1,27,11,28,19,29,1,30,1,31,21,32,13,33,1,34,23,35,1,36,1,37,25,38,11,39,1,40,27,41,1,42,17,43,29,44,1,45,13,46,31,47,19,48,1,49,33,50}</pre> |
<pre>{1,1,1,2,1,3,1,4,3,5,1,6,1,7,5,8,1,9,1,10,7,11,1,12,5,13,9,14,1,15,1,16,11,17,7,18,1,19,13,20,1,21,1,22,15,23,1,24,7,25,17,26,1,27,11,28,19,29,1,30,1,31,21,32,13,33,1,34,23,35,1,36,1,37,25,38,11,39,1,40,27,41,1,42,17,43,29,44,1,45,13,46,31,47,19,48,1,49,33,50}</pre> |
||
=={{header|Modula-2}}== |
|||
<lang modula2>MODULE LargestProperDivisor; |
|||
FROM InOut IMPORT WriteCard, WriteLn; |
|||
VAR i: CARDINAL; |
|||
PROCEDURE lpd(n: CARDINAL): CARDINAL; |
|||
VAR i: CARDINAL; |
|||
BEGIN |
|||
IF n=1 THEN |
|||
RETURN 1; |
|||
END; |
|||
FOR i := n DIV 2 TO 1 BY -1 DO |
|||
IF n MOD i = 0 THEN |
|||
RETURN i; |
|||
END; |
|||
END; |
|||
END lpd; |
|||
BEGIN |
|||
FOR i := 1 TO 100 DO |
|||
WriteCard(lpd(i), 3); |
|||
IF i MOD 10 = 0 THEN |
|||
WriteLn(); |
|||
END; |
|||
END; |
|||
END LargestProperDivisor.</lang> |
|||
{{out}} |
|||
<pre> 1 1 1 2 1 3 1 4 3 5 |
|||
1 6 1 7 5 8 1 9 1 10 |
|||
7 11 1 12 5 13 9 14 1 15 |
|||
1 16 11 17 7 18 1 19 13 20 |
|||
1 21 1 22 15 23 1 24 7 25 |
|||
17 26 1 27 11 28 19 29 1 30 |
|||
1 31 21 32 13 33 1 34 23 35 |
|||
1 36 1 37 25 38 11 39 1 40 |
|||
27 41 1 42 17 43 29 44 1 45 |
|||
13 46 31 47 19 48 1 49 33 50</pre> |
|||
=={{header|Nim}}== |
=={{header|Nim}}== |