Sum of divisors: Difference between revisions
Reordered the Algols
imported>Chinhouse No edit summary |
(Reordered the Algols) |
||
Line 79:
112 168 128 144 120 252 98 171 156 217
</pre>
=={{header|ALGOL-M}}==▼
<syntaxhighlight lang="algolm">begin▼
integer N;▼
N := 100;▼
begin▼
integer array div[1:N];▼
integer i, j, col;▼
for i := 1 step 1 until N do div[i] := 1;▼
for i := 2 step 1 until N do▼
for j := i step i until N do▼
div[j] := div[j] + i;▼
col := 0;▼
for i := 1 step 1 until N do begin▼
if (col-1)/10 <> col/10 then▼
write(div[i])▼
else▼
writeon(div[i]);▼
col := col + 1;▼
end;▼
end;▼
end</syntaxhighlight>▼
{{out}}▼
<pre> 1 3 4 7 6 12 8 15 13 18▼
12 28 14 24 24 31 18 39 20 42▼
32 36 24 60 31 42 40 56 30 72▼
32 63 48 54 48 91 38 60 56 90▼
42 96 44 84 78 72 48 124 57 93▼
72 98 54 120 72 120 80 90 60 168▼
62 96 104 127 84 144 68 126 96 144▼
72 195 74 114 124 140 96 168 80 186▼
121 126 84 224 108 132 120 180 90 234▼
112 168 128 144 120 252 98 171 156 217</pre>▼
=={{header|ALGOL 68}}==
Line 167 ⟶ 133:
112 168 128 144 120 252 98 171 156 217
</pre>
▲=={{header|ALGOL-M}}==
▲<syntaxhighlight lang="algolm">begin
▲ integer N;
▲ N := 100;
▲ begin
▲ integer array div[1:N];
▲ integer i, j, col;
▲ for i := 1 step 1 until N do div[i] := 1;
▲ for i := 2 step 1 until N do
▲ for j := i step i until N do
▲ div[j] := div[j] + i;
▲ col := 0;
▲ for i := 1 step 1 until N do begin
▲ if (col-1)/10 <> col/10 then
▲ write(div[i])
▲ else
▲ writeon(div[i]);
▲ col := col + 1;
▲ end;
▲ end;
▲end</syntaxhighlight>
▲{{out}}
▲<pre> 1 3 4 7 6 12 8 15 13 18
▲ 12 28 14 24 24 31 18 39 20 42
▲ 32 36 24 60 31 42 40 56 30 72
▲ 32 63 48 54 48 91 38 60 56 90
▲ 42 96 44 84 78 72 48 124 57 93
▲ 72 98 54 120 72 120 80 90 60 168
▲ 62 96 104 127 84 144 68 126 96 144
▲ 72 195 74 114 124 140 96 168 80 186
▲ 121 126 84 224 108 132 120 180 90 234
▲ 112 168 128 144 120 252 98 171 156 217</pre>
=={{header|ALGOL W}}==
| |||