uses crt;
var a,b,c,d:array[1..300] of real;
n,t,k:integer;
tg:real;
procedure input;
var f:text;
i,j:integer;
begin
assign(f,'BWPOINT.INP');
reset(f);
readln(f,n);
j:=0;
for i:=1 to n do
begin
read(f,a[i]);
inc(j);
c[j]:=a[i];
end;
readln(f);
for i:=1 to n do
begin
read(f,b[i]);
inc(j);
c[j]:=b[i];
end;
close(f);
end;
procedure quicksort(h,l:integer);
var t,x:real;
k,i,j:integer;
begin
i:=h;
j:=l;
x:=d[random(h-l+1)+l];
repeat
while d[i]<x do inc(i);
while d[j]>x do dec(j);
if i<=j then
begin
t:=d[i];
d[i]:=d[j];
d[j]:=t;
inc(i);
dec(j);
end;
until i>j;
if h<j then quicksort(h,j);
if l>i then quicksort(i,l);
end;
function kt1(k:integer):boolean;
var i:integer;
begin
kt1:=false;
for i:=1 to n do
if a[i]=d[k] then
begin
kt1:=true;
break;
end;
end;
function kt2(k:integer):boolean;
var i:integer;
begin
kt2:=false;
for i:=1 to n do
if b[i]=d[k] then
begin
kt2:=true;
break;
end;
end;
procedure xuli;
var u,i,j:integer;
f:text;
kt3,kt4:boolean;
begin
assign(f,'BWPOINT.OUT');
rewrite(f);
u:=0;
{d:=a; quicksort(1,n); a:=d;
d:=b; quicksort(1,n); b:=d; }
d:=c; quicksort(1,2*n); c:=d;
i:=0;
repeat
inc(i);
kt3:=kt1(i);
if kt3=true then
begin
repeat
inc(i);
kt4:=kt2(i);
until (kt4=true) or (i>=2*n);
end
else
begin
repeat
inc(i);
kt3:=kt1(i);
until (kt3=true) or (i>=2*n);
end;
if (kt3=true) and (kt4=true) then inc(u);
until i>=2*n;
write(f,u);
close(f);
end;
begin
input;
xuli;
end.
có thể bỏ bớt việc sắp xếp hai mảng a và b đi cũng được uses crt;
var a,b,c,d:array[1..300] of real;
n,t,k:integer;
tg:real;
procedure input;
var f:text;
i,j:integer;
begin
assign(f,'BWPOINT.INP');
reset(f);
readln(f,n);
j:=0;
for i:=1 to n do
begin
read(f,a[i]);
inc(j);
c[j]:=a[i];
end;
readln(f);
for i:=1 to n do
begin
read(f,b[i]);
inc(j);
c[j]:=b[i];
end;
close(f);
end;
procedure quicksort(h,l:integer);
var t,x:real;
k,i,j:integer;
begin
i:=h;
j:=l;
x:=d[random(h-l+1)+l];
repeat
while d[i]<x do inc(i);
while d[j]>x do dec(j);
if i<=j then
begin
t:=d[i];
d[i]:=d[j];
d[j]:=t;
inc(i);
dec(j);
end;
until i>j;
if h<j then quicksort(h,j);
if l>i then quicksort(i,l);
end;
function kt1(k:integer):boolean;
var i:integer;
begin
kt1:=false;
for i:=1 to n do
if a[i]=d[k] then
begin
kt1:=true;
break;
end;
end;
function kt2(k:integer):boolean;
var i:integer;
begin
kt2:=false;
for i:=1 to n do
if b[i]=d[k] then
begin
kt2:=true;
break;
end;
end;
procedure xuli;
var u,i,j,m:integer;
f:text;
kt3,kt4:boolean;
begin
assign(f,'BWPOINT.OUT');
rewrite(f);
u:=0;
d:=a; quicksort(1,n); a:=d;
d:=b; quicksort(1,n); b:=d;
d:=c; quicksort(1,2*n); c:=d;
i:=0;
kt3:=false;
kt4:=false;
repeat
m:=0;
inc(i);
if kt1(i)=true then
begin
repeat
inc(i);
until (kt2(i)=true) or (i>=2*n);
if kt2(i)=true then inc(m);
end
else if kt2(i)=true then
begin
repeat
inc(i);
until (kt1(i)=true) or (i>=2*n);
if kt1(i)=true then inc(m);
end;
if m>0 then inc(u);
until i>=2*n;
write(f,u);
close(f);
end;
begin
input;
xuli;
end.const inp='cuong.inp';
outp='cuong.out';
var i,k,j,n:integer;
fi,fo:text;
tg,dem:integer;
a,b,c:array[1..200] of integer;
procedure nhap;
begin
assign(fi,inp);
reset(fi);
read(fi,n );
for i:=1 to n do
begin
read(fi,a[i]);
c[i]:=a[i];
end;
j:=i;
for i:=1 to n do
begin
read(fi,b[i]);
c[i+j]:=b[i] ;
end;
close(fi);
assign(fo,outp);
rewrite(fo);
end;
function kiemtra(x:integer):boolean;
var
kt1,kt2,kt3,kt4:boolean;
begin
kt1:=false;
kt2:=false;
kt3:=false;
kt4:=false;
for i:=1 to n do
begin
if c[x]=b[i] then kt1:=true else kt3:=true;
if c[x+1]=a[i] then kt2:=true else kt4:=true;
end;
if (kt1 and kt2) or (kt3 and kt4) then
kiemtra:=true;
end;
procedure sapsep;
begin
for i:=1 to 2*n do
for j:=1 to i do
if c[i]> c[j] then
begin
tg:=c[i];
c[i]:=c[j];
c[j]:=tg;
end;
end;
procedure xuli;
begin
sapsep;
while k< 2*n-1 do
if kiemtra(k) then
begin
inc(dem);
inc(k,2);
end else
inc(k);
write(fo,dem);
close(fo);
end;
begin
nhap;
xuli;
end.bài anh Thành bị exit code 201 tức có lệnh truy cập ngoài khai báo array anh kiểm tra lại nha
4 1
1 1 1 1
1 1 1 1
1 1 0 1
0 1 1 1 3var d,e,n,k,m,i,j:integer;
f,g:text;
a:array[1..100,1..100]of char;
kt:array[1..100,1..100]of boolean;
procedure input;
begin
assign(f,'bai1.inp');
reset(f);
readln(f,n,m);
for i:=1 to n do
begin
for j:=1 to n do read(f,a[i,j]);
readln(f);
end;
close(f);
end;
function ktmang(k:integer):integer;
begin
for i:=1 to k do
for j:=1 to k do
if a[i,j]='0' then inc(d);
ktmang:=d;
end;
procedure xuli;
begin
d:=0;
for k:=1 to n do
if ktmang(k)=1 then break;
end;
procedure output;
begin
assign(g,'bai1.out');
rewrite(g);
write(g,k);
close(g);
end;
BEGIN
input;
xuli;
output;
END.