begin 

    comment library 1;

    array 
        v, 
        a, 
        c[1 : 1]; 
    integer 
        k; 
    integer procedure i; 
        begin 
        i := 1; 
        k := k + 1
        end; 

    k := 0; 
    a[i] := 1; 
    c[i] := 3; 
    for v[i] := a[i] step a[i] until c[i] do 
        ; 
    outreal(1, k)
end 


algol

begin 

    comment library5;

    integer procedure none; 
        none := 1; 

    none; 
    sin(1.0); 
    abs(3); 
    ln(.2); 
    exp(4); 
    entier(none); 
    sign(sqrt(8)); 
    outreal(1, none)
end 


algol

begin 

    comment library 1;

    integer 
        nn; 
    switch a := 
        b[1], 
        b[2]; 
    switch b := 
        a[g], 
        a[2]; 
    integer procedure f(n, s); 
        value 
            n; 
        integer 
            n; 
        switch 
            s; 
        begin 
        nn := n; 
        goto s[1]; 
        f := nn
        end; 

    integer procedure g; 
        begin 
        integer 
            n; 
        n := nn; 
        g := 0; 
        nn := 
            if n <= 1 then 
                n
            else 
                f(n - 1, a) + f(n - 2, a)
        end; 

    outreal(1, f(20, a))
end 



algol

begin 
comment library 3;


integer i,cl,n,rep;

array r,a,b[1:30],c[1:10];

real j,root,x;

integer procedure even(x);
    value x;
    integer x;
    even:=if x'DIV'2*2 = x then 1 else -1;


procedure gamm(r,a,b,c);
    array r,a,b,c;
    begin    integer rep,i,cl;
        real j,root,x;
        rep:=100*n;
        outreal(cputime);
        for cl:= 1 step 1 until rep do 
            ;
        outreal(cputime);
        rep:=n;
        outreal(cputime);
        for cl:=1 step 1 until rep do 
        for i:= 1 step 1 until 30 do 
            r[i]:=a[i]+b[i];
        outreal(cputime);
        for cl:=1 step 1 until rep do 
        for i:=1 step 1 until 30 do 
            r[i]:=a[i]*b[i];
        outreal(cputime);
        rep:=6*n;
        x := .5;
        outreal(cputime);
        for cl:= 1 step 1 until rep do 
        begin    j:=0.0;
            for i:= 1 step 1 until 10 do 
                j:=(j+c[i])*x
        end;
        outreal(cputime);
        outreal(j);
        outreal(cputime);
        for cl:= 1 step 1 until rep do 
        begin    j:=c[1];
            for i:=2 step 1 until 10 do 
                if c[i]>j then j:=c[i]
        end;
        outreal(cputime);
        j:=2;
        rep := 8*n;
        outreal(cputime);
        for cl:=1 step 1 until rep do 
        begin    root:=1.0;
            for i:=1 step 1 until 5 do 
                root:= 0.5*(root+j/root)
        end;
        outreal(cputime);
        outreal(root);
    end of gamm;


    i:=1;
    for j:=104.5,3.7,-68.9,228.2,-1004.4,500.0,308.1,45.0,152.35,161.8 do 
    begin    c[i]:=j;
        i:=i+1
    end;
    for i:=1 step 1 until 30 do 
    begin    a[i]:=even(i)*i*i;
        b[i]:=1-even(i)*i*i
    end;
    n := 2000;
    rep:=100*n;
    outreal(cputime);
    for cl:= 1 step 1 until rep do 
        ;
    outreal(cputime);
    rep:=n;
    outreal(cputime);
    for cl:=1 step 1 until rep do 
    for i:= 1 step 1 until 30 do 
        r[i]:=a[i]+b[i];
    outreal(cputime);
    for cl:=1 step 1 until rep do 
    for i:=1 step 1 until 30 do 
        r[i]:=a[i]*b[i];
    outreal(cputime);
    rep:=6*n;
        x := .5;
    outreal(cputime);
    for cl:= 1 step 1 until rep do 
    begin    j:=0.0;
        for i:= 1 step 1 until 10 do 
            j:=(j+c[i])*x
    end;
    outreal(cputime);
    outreal(j);
    outreal(cputime);
    for cl:= 1 step 1 until rep do 
    begin    j:=c[1];
        for i:=2 step 1 until 10 do 
            if c[i]>j then j:=c[i]
    end;
    outreal(cputime);
    j:=2;
    rep := 8*n;
    outreal(cputime);
    for cl:=1 step 1 until rep do 
    begin    root:=1.0;
        for i:=1 step 1 until 5 do 
            root:= 0.5*(root+j/root)
    end;
    outreal(cputime);
    outreal(root);
    gamm(r,a,b,c);

end 

algol

begin 
comment library 1;
    real 
        x, 
        y; 
    procedure dum; 
        ; 

    real procedure a; 
        a := x + (if b then 1 else 0); 

    boolean 
        b; 
    s2 :; 
    b := ((true )); 
    g :; 
    begin 
        integer 
            i; 
        x := - 3; 
        if not b then 
            goto s2; 
        i := 1; 
        y := a - i * x^2; 
        dum
    end; 
    outreal(1, y / 2)
end 


algol
prog : 

begin 
comment library 1;
    procedure q; 
        begin 
        array 
            a, 
            d[1 : 1, 1 : n], 
            e[0 : 0]; 
        procedure p(x, l); 
            label 
                l; 
            integer procedure 
                x; 
            b : for i := 1 step 1 until n, 
                i + 1 do 
                c : goto 
                    if x(a[1, 1] + i, 0) = 0 then 
                        l
                    else 
                        r; 

        m :; 
        a[1, 1] := n; 
        p(in, prog)
        end q; 

    integer procedure in(f, g); 
        value 
            f; 
        real 
            f, 
            g; 
        n := in := 1; 

    integer 
        n, 
        i; 
    n := 2; 
    outreal(1, 1); 
    q; 
    outreal(1, 2); 
    r :; 
    outreal(1, 3); 
end 



algol

begin 

    comment library 1;

    integer 
        i; 
    real 
        x; 
    i := 1; 
    for x := .1 step x until 1.0@6 do 
        i := i + 1; 
    outreal(1, i)
end 


algol

begin 

    comment library 1;

    integer 
        a; 
    integer procedure f(x, y); 
        value 
            x, 
            y; 
        integer 
            x, 
            y; 
        a := f := x + 1; 

    integer procedure g(x); 
        integer 
            x; 
        x := g := a + 2; 

    a := 0; 
    outreal(1, a + f(a, g(a)) / g(a))
end 


algol

begin 

    comment library 1;

    real 
        i, 
        j; 
    array 
        a[1 : 2, 1 : 3]; 
    real procedure gps(i, n, z, v); 
        real 
            i, 
            n, 
            z, 
            v; 
        begin 
        for i := 1 step 1 until n do 
            z := v; 
        gps := 1
        end; 

    outreal(1, gps(j, 3.0, i, gps(i, 2.0, a[i, j], i + j))); 
    for i := 1 step 1 until 2 do 
        for j := 1 step 1 until 3 do 
            if a[i, j] \= i + j then 
                outreal(1, 11 * i + j)
end 




algol

begin 
comment library5;
    real 
        r; 
    boolean 
        b; 
    integer procedure f(x); 
        real 
            x; 
        f := 0; 

    integer 
        i, 
        n, 
        s; 
    integer procedure g(y); 
        boolean 
            y; 
        g := 
            if y then 
                2
            else 
                3; 

    r := 3.5; 
    n := 4; 
    s := r + (1) + n; 
    outreal(1, s); 
    begin 
        real array 
            ra[f(if true then 0 else 0) : 1]; 
        array 
            a[ - 1 : f(0)]; 
        real procedure q; 
            q := r^2; 

        s := 
            if + 0 = 0 then 
                sqrt(q)
            else 
                1
    end; 
    outreal(1, s); 
    begin 
        procedure w(t, u); 
            string 
                t, 
                u; 
            ; 

        w( [ a 'REAL' ], [ b 'END' ] ); 
        for i := 0 do 

    end; 
    if 2 = 2 then 
        begin 
        i := 1
        end 
    else 
        i := 0; 
    for i := 5 while r < n do 
        c : begin 
        b := true; 
        n := 
            if b or not b then 
                g(b or b) div s
            else 
                10; 
        b := 
            if b then 
                false or false 
            else 
                true; 
        r := n / 2
        end; 
    outreal(1, n); 
end 


kdf9