Warning: file_get_contents(/data/phpspider/zhask/data//catemap/4/fsharp/3.json): failed to open stream: No such file or directory in /data/phpspider/zhask/libs/function.php on line 167

Warning: Invalid argument supplied for foreach() in /data/phpspider/zhask/libs/tag.function.php on line 1116

Notice: Undefined index: in /data/phpspider/zhask/libs/function.php on line 180

Warning: array_chunk() expects parameter 1 to be array, null given in /data/phpspider/zhask/libs/function.php on line 181
Matrix 计算矩阵中的空对角线_Matrix_Diagonal - Fatal编程技术网

Matrix 计算矩阵中的空对角线

Matrix 计算矩阵中的空对角线,matrix,diagonal,Matrix,Diagonal,我试图创建一个程序来计算正方形矩阵中空对角线的数量,但是我似乎找不到正确的方法使我的索引在整个矩阵中正确运行。以下是迄今为止我得到的错误代码: # include<stdio.h> # define MAX 100 int DiagonNull (int n, int A[MAX][MAX]) { int i, j, count, null; banda = 0; for(i = n - 1; i >= 0; i--){ count = 0; for(j

我试图创建一个程序来计算正方形矩阵中空对角线的数量,但是我似乎找不到正确的方法使我的索引在整个矩阵中正确运行。以下是迄今为止我得到的错误代码:

# include<stdio.h>

# define MAX 100

int DiagonNull (int n, int A[MAX][MAX]) {
int i, j, count, null;

banda = 0;

for(i = n - 1; i >= 0; i--){
    count = 0;
    for(j = 0; j <= n && j < i - 1; j++){
        if (A[i][j] == 0)
            count++;
    }
    if (count == n - i) /* n - i = number of elements in diagonal */
        null++;
    else
        i = - 1;
}
return null;
}

int main () {

int n, A[MAX][MAX], i, j, null;
printf ("Enter value of n to create a square matrix A of order n: ");
scanf ("%d", &n);

printf ("Enter the elements of matrix A: ");
for (i = 0; i < n; i++){
    for (j = 0; j < n; j++){
        scanf("%d", &A[i][j]);
    }
}

null = DiagonNull (n, A);
printf ("Matrix has null %d diagonals", null);

return 0;
}
#包括
#定义最大值100
int diagonnul(int n,int A[MAX][MAX]){
int i,j,count,null;
班达=0;
对于(i=n-1;i>=0;i--){
计数=0;

对于(j=0;j),您是否要计算给定方阵对角线中的空条目数,即0?您是否只关心主对角线?