833
Christian Urban <christian.urban@kcl.ac.uk>
parents:
diff
changeset
|
1 |
// Find all factors of a given input number
|
Christian Urban <christian.urban@kcl.ac.uk>
parents:
diff
changeset
|
2 |
|
Christian Urban <christian.urban@kcl.ac.uk>
parents:
diff
changeset
|
3 |
|
Christian Urban <christian.urban@kcl.ac.uk>
parents:
diff
changeset
|
4 |
write "Input n please";
|
Christian Urban <christian.urban@kcl.ac.uk>
parents:
diff
changeset
|
5 |
read n;
|
|
853
|
6 |
write "\nThe factors of n are";
|
833
Christian Urban <christian.urban@kcl.ac.uk>
parents:
diff
changeset
|
7 |
f := 2;
|
Christian Urban <christian.urban@kcl.ac.uk>
parents:
diff
changeset
|
8 |
while (f < n / 2 + 1) do {
|
Christian Urban <christian.urban@kcl.ac.uk>
parents:
diff
changeset
|
9 |
if ((n / f) * f == n) then { write(f) } else { skip };
|
Christian Urban <christian.urban@kcl.ac.uk>
parents:
diff
changeset
|
10 |
f := f + 1
|
Christian Urban <christian.urban@kcl.ac.uk>
parents:
diff
changeset
|
11 |
} |