aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

2016 Update

Browse source
This commit is contained in:
Tina Müller 2016-12-05 22:15:40 +01:00
parent 948b86eafa
commit dcf5d15da3
7965 changed files with 139854 additions and 31002 deletions
Download patch file Download diff file Expand all files Collapse all files

45
Task/Subtractive-generator/REXX/subtractive-generator.rexx
View file

@ -1,23 +1,24 @@
/*REXX pgm uses a subtractive generator, creates a sequence of random numbers.*/
numeric digits 20; s.0=292929; s.1=1; billion=10**9
cI=55; cJ=24; cP=34; billion=1e9 /* [↑] same*/
do i=2 to cI-1
s.i=mod(s(i-2) - s(i-1), billion)
end /*i*/
do j=0 to cI-1
r.j=s(mod(cP*(j+1), cI))
end /*j*/
m=219
do k=cI to m; x=k//cI
r.x=mod(r(mod(k-cI, cI)) - r(mod(k-cJ, cI)), billion)
end /*m*/
/*REXX program uses a subtractive generator, and creates a sequence of random numbers. */
s.0=292929; s.1=1; billion=10**9 /* ◄────────┐ */
numeric digits 20; billion=1e9 /*same as─►─┘ */
cI=55; do i=2 to cI-1
s.i=mod(s(i-2) - s(i-1), billion)
end /*i*/
Cp=34
do j=0 to cI-1
r.j=s(mod(cP*(j+1), cI))
end /*j*/
m=219; Cj=24
do k=cI to m; _=k//cI
r._=mod(r(mod(k-cI, cI)) - r(mod(k-cJ, cI)), billion)
end /*m*/
t=235
do n=m+1 to t; y=n//cI
r.y=mod(r(mod(n-cI, cI)) - r(mod(n-cJ, cI)), billion)
say right(r.y, 40)
end /*n*/
exit /*stick a fork in it, we're all done. */
/*────────────────────────────────────────────────────────────────────────────*/
mod: procedure; parse arg a,b; return ((a // b) + b) // b
r: parse arg _; return r._
s: parse arg _; return s._
do n=m+1 to t; _=n//cI
r._=mod(r(mod(n-cI, cI)) - r(mod(n-cJ, cI)), billion)
say right(r._, 40)
end /*n*/
exit /*stick a fork in it, we're all done. */
/*──────────────────────────────────────────────────────────────────────────────────────*/
mod: procedure; parse arg a,b; return ((a // b) + b) // b
r: parse arg #; return r.#
s: parse arg #; return s.#