Var naibolwee:int64;
i:integer;
A:array [1..4] of int64;
function max(a,b:int64):int64;
begin
if a>b then max:=a else max:=b;
end;
begin
for i:=1 to 4 do
read(A[i]);
for i:=1 to 3 do
naibolwee:=max(A[i],A[i+1]);
writeln(naibolwee);
<span>end.</span>
Var n,a,b,c,d:integer;
begin read(n);
a:=n div 1000;
b:=n div 100 mod 10;
c:=n div 10 mod 10;
d:=n mod 10;
n:=1000*a+100*c+10*b+d;
writeln(n);
<span>end.</span>
Var n,i: integer;
begin
readln(n);
for i:=1 to 9 do
writeln(n,'*',i,'=',n*i);
end.
25-->11001
/////////////////////
Ответ:
Программа на паскале:
const
MAX_N = 20001;
var
a: array[1 ... MAX_N] of integer;
n, i, j, p, maxp: integer;
begin
i : = 1;
read (a[i]) ;
while a[i] 0 do
begin
inc (i) ;
read (a[i]) ;
end;
n : = i - 1;
maxp : = 0;
for i : = 1 to n do
for j : = 1 to n do
begin
p : = a[i] * a[j];
if (p mod 26 = 0) and (p > maxp) then
maxp : = p;
end;
if maxp = 0 then writeln ('Not found')
else writeln (maxp) ;
Объяснение: