Wpis z mikrobloga

@intires98:

int det(sizet n, int a[][n])
{
size
t i, aj, bj, k, d;
int l = 0;
int sign = 1;

if(n == 2)
{
d = a[0][0] * a[1][1] - a[0][1] * a[1][0];

return d;
}

else
for (k = 0; k < n ; k++)
{
int b[n-1][n-1];

for (i = 1; i < n; i++)
{
for (aj = 0, bj = 0; aj < n;