Var a:array[1..3,1..3] of integer;
i,j,s:integer;
begin
for i:=1 to 3 do
for j:=1 to 3 do begin
read(a[i,j]);
if not odd(a[i,j]) then s+=a[i,j];
end;
writeln(s);
<span>end.</span>
<em>MS DOS QBasic 1.0</em>
RANDOMIZE TIMER
CONST n = 9
DIM a(1 TO n) AS INTEGER
CLS
FOR i = 1 TO n
a(i) = INT(99 * RND)
PRINT a(i);
NEXT i
PRINT
FOR i = 1 TO n - 1
FOR j = i + 1 TO n
IF a(i) < a(j) THEN
t = a(i)
a(i) = a(j)
a(j) = t
END IF
NEXT j
NEXT i
FOR i = 1 TO n
PRINT a(i);
NEXT i
<u>Пример</u>
85 21 7 21 29 45 98 70 23
98 85 70 45 29 23 21 21 7
Import java.util.*;
import java.io.*;
import java.lang.*;
class Program {
public static void main(String[] args) {
Scanner Scan = new Scanner(System.in);
Random rand = new Random();
int A = rand.nextInt(151)+5;
if ((25 < A)&&(A < 100)) System.out.printf("%d ∈ (25,100)",A);
else System.out.printf("%d ∉ (25,100)",A);
}
}
procedure pr_max(a,b,c:integer; var max:integer);
begin
if a>b then max:=a else max:=b;
if c>max then max:=c;
end;
var m:integer;
begin
pr_max(15,47,24,m);
writeln(m);
end.
Результат:
47