Uses wincrt
var
i,j,k,n,m : integer;
A : array[1..5,1..5] of integer;
min : array[1..10] of integer;
begin
for i:= 1 to 5 do
for j:= 1 to 5 do
begin
writeln('Enter A[',i,j,']');
read(A[i,j]);
end;
for m:= 1 to 5 do {Row}
begin
min[m]:=A[m,1];
for k:= 2 to 5 do
if a[m,k] < min[m] then
min[m]:=a[m,k];
end;
for m:= 1 to 5 do {column}
begin
min[m+5]:=A[1,m];
for k:= 2 to 5 do
if a[k,m] < min[m+5] then
min[m+5]:=a[k,m];
end;
for i:= 1 to 5 do
for j:= 1 to 5 do
begin
write(' ',A[i,j]);
if j=5 then
begin
write(' ',min[i]);
writeln;
end;
end;
writeln;
for n:=1 to 5 do
write(' ',min[n+5]);
end.uses wincrt;
var
n:integer;
begin
readln(n);
while n>0 do
begin
write(n mod 10);
n:=n div 10
end;
end.uses wincrt;
var
a : array[1..3,1..3] of integer;
diter,m,f,i,j : integer;
begin
writeln('Enter Number Of Matrix');
for i:=1 to 3 do
for j:= 1 to 3 do
begin
writeln('Enter A[',i,j,']');
read(A[i,j]);
end;
m := ((a[1,1]*a[2,2]*a[3,3])+(a[1,2]*a[2,3]*a[3,1])+(a[1,3]*a[2,1]*a[3,2]));
f := ((a[1,3]*a[2,2]*a[3,1])+(a[1,2]*a[2,1]*a[3,3])+(a[1,1]*a[2,3]*a[3,2]));
diter := m-f;
writeln;
writeln('Determinant Of Matrix Is : ',diter);
end.uses wincrt;
var
i,a,n,j,cnt,k : integer;
flag : boolean;
begin
writeln('Enter Number For N');
readln(n);
cnt:=0;
for i:= 1 to n do
begin
if i<=n then
begin
writeln('enter ',i,' number');
readln(a);
if a=1 then
begin
writeln('number 1 is not prime and complete therefore enter an other number');
readln(a);
i:=i+1
end;
flag:=true;
k:=0;
j:=2;
end;
while (j<=a div 2) and (k=0) do
begin
if (a mod j =0) then
k:=1;
j:=j+1;
end;
if (k=0) then
cnt:=cnt+1;
end;
writeln('number of prime number is :',cnt)
end.uses wincrt;
var
m,n,r,temp : integer;
begin
writeln('Enter two Number');
readln(m,n);
if m<n then
begin
temp:=n;
n:= m;
m:=temp;
end;
while m mod n <> 0 do
begin
r:=m mod n;
m:=n;
n:=r;
end;
writeln('B.M.M Of two number is : ',n);
end.