DataMuseum.dk

Presents historical artifacts from the history of:

RC4000/8000/9000

This is an automatic "excavation" of a thematic subset of
artifacts from Datamuseum.dk's BitArchive.

See our Wiki for more about RC4000/8000/9000

Excavated with: AutoArchaeologist - Free & Open Source Software.


top - metrics - download

⟦f0a0c6d7c⟧ TextFile

    Length: 2304 (0x900)
    Types: TextFile
    Names: »kkrenteøv2t«

Derivation

└─⟦621cfb9a2⟧ Bits:30002817 RC8000 Dump tape fra HCØ.  Detaljer om "HC8000" projekt.
    └─⟦0364f57e3⟧ 
        └─⟦508e019d6⟧ »kkfiler« 
            └─⟦this⟧ 
└─⟦00964e8f7⟧ Bits:30007478 RC8000 Dump tape fra HCØ.
    └─⟦b2ec5d50f⟧ 
        └─⟦8748ba386⟧ »kkfiler« 
            └─⟦this⟧ 

TextFile

kkrent=algol
begin
  integer i,j,kn,p,n,y,k,an,pt,max,tt;
  real r,r1,s;
  real array facit(1:50);
  max:=12;
  write(out,<:<12><10><10>:>,
  <:                                            r<10>:>,
  <:Øvelser i brug af formlen       y  = G* ------------<10>:>,
  <:                                                  -n<10>:>,
  <:                                          1 -(1+r):>);
  write(out,<:<10><10>   1) Find ydelsen når:>);
  write(out,<:<10>                  G        %       n:>);
  tt:=1;
  for i:=1 step 1 until max do
  begin
    k:=random(j)*10000;
    p:=random(j)*15+1;
    n:=random(j)*56+4;
    write(out,<:<10>        :>,false add (i+96),1,<:)  :>,<<dddddddd>,k,p,n);
    r:=p; r:=r/100; r1:=r+1;
    facit(i):=k*r/(1-r1**(-n));
  end;
  tt:=2;
  write(out,<:<10><10>   2) Find G når:>);
  write(out,<:<10>                  y        %       n:>);
  for i:=1 step 1 until max do
  begin
    s:=random(j)*1000;
    p:=random(j)*15+1;
    n:=random(j)*56+4;
    r:=p; r:=r/100; r1:=r+1;
    write(out,<:<10>        :>,false add (i+96),1,<:)  :>,<<dddddd.dd>,s,<<dddddddd>,p,n);
    facit((tt-1)*max+i):=s*(1-r1**(-n))/r;
  end;
  tt:=3;
  write(out,<:<10><10>   3) Find antal terminer når:>);
  write(out,<:<10>                  y       G        %:>);
  for i:=1 step 1 until max do
  begin
    k:=random(j)*10000;
    p:=random(j)*15+1;
    n:=random(j)*56+4;
    r:=p; r:=r/100; r1:=r+1;
    s:=k*r/(1-r1**(-n));
    write(out,<:<10>        :>,false add (i+96),1,<:)  :>,<<ddddd.dd>,s,<<dddddddd>,k,p);
    facit((tt-1)*max+i):=n;
  end;
  write(out,false add 10,2,<:Resultater:<10>:>);
  pt:=0;
  for j:=0 step 1 until tt-1 do
  begin
  for i:=1 step 1 until max do
  begin
    pt:=pt+write(out,j+1,false add (i+96),1,<:) :>,
    case (j+1) of (<< dddddddd.dd>,<< dddddddd.dd>,<< dddd>,<<dddd>),
    facit(j*max+i),<:   :>);
    if pt>55 then
    begin  outchar(out,10); pt:=0; end;
  end;
  outchar(out,10); pt:=0;
  end;
end;
▶EOF◀