y = 1

while y==1
c=0
clc
fprintf('Gauss-Jordan:\n');

a = input('\nEscreva a matriz ampliada: \n');

g=a

% Aplicando o m�todo
[m,n]=size(a);
for j=1:m-1
for z=2:m
if a(j,j)==0
t=a(1,:);a(1,:)=a(z,:);
a(z,:)=t;
end
end
for i=j+1:m
a(i,:)=a(i,:)-a(j,:)*(a(i,j)/a(j,j));
end
end

for j=m:-1:2
for i=j-1:-1:1
a(i,:)=a(i,:)-a(j,:)*(a(i,j)/a(j,j));
end
end

for s=1:m
a(s,:)=a(s,:)/a(s,s);
x(s)=a(s,n);
end

r=a(:,m)
b=a
clc

fprintf('Gauss-Jordan:\n');
fprintf('\nMatriz de entrada:\n');
g
fprintf('\nMatriz escalonada reduzida:\n');
b
fprintf('\nSolu��es:\n');
r

while c==0
y = input('\nDeseja fazer novamente? (1 -sim/2 -nao)\n');
switch y
case 1
c=1
y=1
case 2
y=2
c=1
otherwise
c=0
clc
fprintf('\nOpcao incorreta. Tente novamente \n')
end
end

clc
fprintf('\nPROGRAMA ENCERRADO.\n')

end