Câu 1:
program bai_giai;
var f,g:text;
A:array[1..10000] of longint;
n,i,j,tg:longint;
begin
Assign(f,'tepcho.pas'); reset(f);
Assign(g,'sapxep.pas'); rewrite(g);
readln(f,n);
for i:=1 to n do read(f,A[i]);
for i:=1 to n-1 do
for j:=i+1 to n do
if A[i]>A[j] then
begin
tg:=A[i];
A[i]:=A[j];
A[j]:=tg;
end;
for i:=1 to n do write(g,A[i],' ');
writeln(g);
for i:=n downto 1 do write(g,A[i],' ');
close(f); close(g);
end.
Bài 2:
program bai_giai;
var f,g:text;
A:array[1..10000] of longint;
n,i,max,min,bt1,vt2:longint;
begin
Assign(f,'tepcho.pas'); reset(f);
Assign(g,'maxmin.pas'); rewrite(g);
readln(f,n);
for i:=1 to n do read(f,A[i]);
max:=A[1]; min:=A[1]; vt1:=1; vt2:=1;
for i:=2 to n do
begin
if A[i]>max then
begin
max:=A[i]; vt1:=i;
end;
if A[i]<min then
begin
min:=A[i]; vt2:=i;
end;
end;
writeln(g,max,' ',vt1);
writeln(g,min,' ',vt2);
close(f); close(g);
end.
Bài 3:
program bai_giai;
var f,g:text;
A:array[1..10000] of longint;
n,i,t:longint;
begin
Assign(f,'tepcho.pas'); reset(f);
Assign(g,'tong.pas'); rewrite(g);
readln(f,n);
for i:=1 to n do read(f,A[i]);
t:=0;
for i:=1 to n do t:=t+A[i];
write(g,t);
close(f); close(g);
end.
Bài 4:
program bai_giai;
var f,g:text;
A:array[1..10000] of longint;
n,i:longint;
function ktnt(k:longint):boolean;
var r:longint;
begin
ktnt:=false;
if k<2 then exit;
for r:=2 to trunc(sqrt(k)) do
if k mod r=0 then exit;
ktnt:=true;
end;
BEGIN
Assign(f,'tepcho.pas'); reset(f);
Assign(g,'maxmin.pas'); rewrite(g);
readln(f,n);
for i:=1 to n do read(f,A[i]);
for i:=1 to n do
if A[i] mod 2=0 then write(g,A[i],' ');
writeln(g);
for i:=1 to n do
if A[i] mod 2=1 then write(g,A[i],' ');
writeln(g);
for i:=1 to n do
if ktnt(A[i]) then write(g,A[i],' ');
close(f); close(g);
END.