June 2018 Update
This commit is contained in:
parent
ba8067c3b7
commit
22f33d4004
5278 changed files with 84726 additions and 14379 deletions
26
Task/Josephus-problem/Modula-2/josephus-problem.mod2
Normal file
26
Task/Josephus-problem/Modula-2/josephus-problem.mod2
Normal file
|
|
@ -0,0 +1,26 @@
|
|||
MODULE Josephus;
|
||||
FROM FormatString IMPORT FormatString;
|
||||
FROM Terminal IMPORT WriteString,WriteLn,ReadChar;
|
||||
|
||||
PROCEDURE Josephus(n,k : INTEGER) : INTEGER;
|
||||
VAR a,m : INTEGER;
|
||||
BEGIN
|
||||
m := 0;
|
||||
FOR a:=1 TO n DO
|
||||
m := (m + k) MOD a;
|
||||
END;
|
||||
RETURN m
|
||||
END Josephus;
|
||||
|
||||
VAR
|
||||
buf : ARRAY[0..63] OF CHAR;
|
||||
n,k,i : INTEGER;
|
||||
nl,kl,il : LONGCARD;
|
||||
BEGIN
|
||||
n := 41;
|
||||
k := 3;
|
||||
FormatString("n = %i, k = %i, final survivor: %i\n", buf, n, k, Josephus(n, k));
|
||||
WriteString(buf);
|
||||
|
||||
ReadChar
|
||||
END Josephus.
|
||||
Loading…
Add table
Add a link
Reference in a new issue