OJ Board

Code: Select all

PROGRAM SAMPLEINPUT;
1       2

VAR
3
  TEMP : RECORD
  4      5 
  FIRST, SECOND : REAL;
  6      7        8
  END;
  9

BEGIN {Ignore this }
10   11
TEMP.FIRST := 5.0E -  2;
12         13 14  15 16
READLN (  TEMP.SECOND); 
17     18 19
WRITELN ( 'THE ANSWER IS', TEMP.FIRST *  TEMP.SECOND : 7 : 3)
20     21 22               23         24 25            26 27
END.
28

~~A. N. Onymous

Code: Select all

1       2
PROGRAM SAMPLEINPUT;

3
VAR

  4      5
  TEMP : RECORD
  
    6      7        8
    FIRST, SECOND : REAL;
    
    9
    END;
    
10
BEGIN {Ignore this }

11   12    13 14
TEMP.FIRST := 5.0E-2;

15     16 17   18
READLN (  TEMP.SECOND); 

19      20 21               22   23     24 25   26       27  28
WRITELN (  'THE ANSWER IS', TEMP.FIRST  *  TEMP.SECOND : 7 : 3  )

29
END.
~~A. N. Onymous

Code: Select all

program test;
VAR
ch : array [1..20] of Char;
BEGIN {Ignore 'like a string'}
(* Comments can be splitted over several lines
and all the operators like + - * / should be ignored
*) Temp := 2;
iden := $abFe90;
_iden_ := 1e-90;
END.
~~Jan

Code: Select all

Program by Jan contains 21 units.

Code: Select all

program test;
VAR
ch:array['a' .. 'z']of Char;
BEGIN{Ignore 'like a
string'}
(* Comments can be splitted over several lines
and all the operators like + - * / should be ignored
*)Temp:=2;
WRITELN ('''', TEMP.FIRST <= TEMP.SECOND : 7 : 3)
WRITELN ('''a is b''s', TEMP.FIRST <> TEMP.SECOND : 7 : 3)
iden:=($abFe90+1e-90)*2;
END.
~~bleed1979

Code: Select all

Program by bleed1979 contains 43 units.

Code: Select all

begin
    comment Algol program print the primes less than 1000 using the 
            sieve method.;
    Boolean array sieve[2:1000];
    integer p, count;

    comment Eliminate the multiples of the argument prime number;
    procedure eliminate(p);
        integer p;
        begin
            integer i;
            for i := 2*p step p until 1000 do
                sieve[i] := false
        end;

    comment Clear the sieve.;
    integer i;
    for i := 2 step 1 until 1000 do
        sieve[i] := true;

    comment Find the primes in range.;
    for i := 2 step 1 until 1000 do
        if sieve[i] then
            eliminate(i);

    comment Print the results, 10 per line.;
    p := 2;
    for count := 0 while p <= 1000 do begin
        comment This construct is similar to a do .. while built with a goto.;
        makeline:
            if sieve[p] then begin
                outinteger(1,p);
                outstring(1,' ');
                count := count + 1
            end;
            p := p + 1;
            if p <= 1000 & count < 10 then goto makeline;
        outstring(1,'\n')
    end

end
~~Algol