c - "for"循环出错，我认为是内存问题-6ren

c - "for"循环出错，我认为是内存问题

转载作者：行者123 更新时间：2023-11-30 15:51:33

我正在尝试创建一个算法，循环“for”十次，最终目标是打印出一个 50x50 矩阵，其值之和大于或等于 49、0 和1 表示为“*”，但由于某些奇怪的原因，循环只进行 3 次迭代，而不是 10 次......

#include <stdio.h>
void printsimulaciodeu(int matlefa[50][50]) {
int ii, jj;
for (ii = 0; ii < 50; ii++) {
    for (jj = 0; jj < 50; jj++) {
        if(matlefa[ii][jj] == 0) {
            printf(" 0 ");
        }
        else if (matlefa[ii][jj] >= 49) {
            printf(" %d ", matlefa[ii][jj]-48);
        }
        else {
            printf(" * ");
            }
    }
    printf("\n");    
}
}
int main(){
    int tabla[50][50]={ 
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
    {0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
    {0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}, 
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},  
    {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
    };

    int its;
    int i, j;
    int disparos_pos[10] = {1, 5, 14, 22, 37, 48, 43, 40, 28, 19};
    char disparos_dir[10]= {'i','i','d','i','d','d','i','d','d','i'};
    int mataux[50][50];
    for (i = 0; i < 50; i++) {
        for (j = 0; j < 50; j++) {
            mataux[i][j] = tabla[i][j];
        }
    }
    int matsuma[50][50];
    for (its = 0; its < 10; its++) {
        int pos = disparos_pos[its];
        int dir = disparos_dir[its];
        i = 0;
        j = pos;
        int cont = 49;
        while (i < 49) {
            if (mataux[i+1][j] == 0) {
                mataux[i+1][j] = cont;
                ++i;
            }
            else {
                if (dir == 'i') {
                    if (mataux[i+1][j] != 0) {
                        if (mataux[i][j-1] == 0) {
                            mataux[i][j-1] = cont;
                            --j;
                        }
                        else {
                            dir = 'd';
                        }
                    }
                }
                if (dir == 'd') {
                    if (mataux[i+1][j] != 0) {
                        if (mataux[i][j+1] == 0) {
                            mataux[i][j+1] = cont;
                            ++j;
                        }
                        else {
                            dir = 'i';
                        }
                    }
                }
            }
        }

        if (its == 0) {
            int m, n;
            for (m = 0; m < 50; m++) {
                for (n = 0; n < 50; n++) {
                    matsuma[m][n] = mataux[m][n];
                }
            }
        }
        if (its > 0) {
            int p, q;
            for (p = 0; p < 50; p++) {
                for (q = 0; q < 50; q++) {                
                    if (mataux[p][q] == 49) {
                        if (matsuma[p][q] >= 49) {
                            matsuma[p][q] = matsuma[p][q]+1;
                        }
                    }
                }
            }
        }
    }

    printsimulaciodeu(matsuma);
}

我认为一种可能性是进程的内存是完整的，因此无法正确迭代，这可能吗？

请帮忙，我需要它才能顺利完成大学学业。

最佳答案

经过一番调试，我发现了实际问题:您的 while 循环将在 for 循环的第三次迭代中运行无限时间。

说明

while 循环运行正常，直到 i=33当 i=33 (j = 21, dir = 'i') 时，不会执行任何赋值语句 (mataux[blah][blah] = blah balh)，因为条件结果为 false。最终结果是'dir'的值在'i'和'd'之间切换，并且循环将永远运行!!

详细信息

mataux[i+1][j] = mataux[34][21] = 1 != 0 ---> 跳过第一个 IF

mataux[i][j-1] = mataux[33][20] = 49 != 0 ---> WHILE 的第一个 ELSE 中的第三个 IF 被跳过

其他 --> dir = 'd' (100)

mataux[i][j+1] = mataux[33][22] = 1 != 0 ---> 跳过最后一个 IF block 中的第三个 IF

其他 --> dir = "i"(105)

希望这有帮助!

关于c - "for"循环出错，我认为是内存问题，我们在Stack Overflow上找到一个类似的问题： https://stackoverflow.com/questions/15040782/

文章推荐： c - 使用子字符串的转换规则转换字符串

文章推荐： android - 为 Android 构建 ImageMagick

PHP 认为 P == 0
这个问题不太可能帮助任何 future 的访问者；它只与一个小的地理区域、一个特定的时间点或一个非常狭窄的情况有关，这些情况并不普遍适用于互联网的全局受众。为了帮助使这个问题更广泛地适用，visit
ruby - 认为 ruby 中缺少方法是否可疑？
class Person def name puts "Doharey" end end puts Person.class #=> this out puts Class puts
PHP 认为 null 等于零
在 PHP 中，($myvariable==0)当 $myvariable 为零时，表达式的值为真；当 $myvariable 为 null 时，此表达式的值也为 true。如何排除第二种情况？我的意
【方向盘】认为：开发者已无理由再用Java EE
正文 Oracle的一顿猛如虎操作，让开发者彻底失去了Java EE。Eclipse基金会则自立门户，另起炉灶开启Jakarta EE项目。对于Jakarta EE，从它
认为 mahotas.imread 找不到 freeimage
我是 python 新手，建议我使用 Canopy。我正在努力跟进 with this tutorial ，但我陷入了 mahotas.imread 行。我收到一个错误，说以这个结尾: Full er
javascript - NVDA 认为 HTML 标题是可点击的
上下文是我们想要跟踪应用程序的用户行为，因为它具有不同的功能。为此，我们创建了一个自定义 Angular Directive(指令)，例如myFunctionality并将 HTML 部分包装到此指
javascript - Google 认为 api 无法正常工作
我正在尝试在文本字段中实现 google Places api 的自动完成功能。这是我的代码: $(document).ready(function() { initialize(){ v
Glassfish 认为 jdbcRealm 实际上是 fileRealm
我在 Glassfish 3.1.1 中配置了一个新的 jdbcRealm 并打开了 FINEST 日志记录，当我尝试使用用户名和密码登录时，我得到以下信息。它提示我的 Web 应用程序映射到的领域是
.net - IIS 认为 web 服务是空闲的
问题是，即使我将线程设置为“thrd.IsBackground = false”，iis 也不认为它正在运行，即使这是一个长时间运行的进程。如果我不关闭应用程序池的空闲关闭，它将关闭，因为它认为它是空
java - Keytool 认为 cacerts 不存在
我正在使用 OpenJDK 8(从 https://jdk.java.net/java-se-ri/8 下载并解压，添加到 PATH)，并且遇到了证书错误。经过调查，我意识到 cacerts 存在问
ios - Swift 认为 Structure 中的变量是可选的
我基于 Firebase 制作了简单的后期制作项目。我将帖子保存到 Firebase 中，如下所示: let data = UIImageJPEGRepresentation(newPostImage
Java 认为 C :\drive is hidden?
我觉得还是先说明情况比较好。情况我正在编写一些软件来过滤 Set 的 File。过滤器如下:如果文件未隐藏，则将其添加到新的 Set。问题在于 File.isHidden() 的当前行为如下:
c++ - 我*认为*我有内存泄漏。现在怎么办？
我创建了一个 C++ DLL 函数，它使用多个数组来处理最终的图像数据。我正在尝试通过引用传递这些数组，进行计算，然后通过预分配数组中的引用将输出传回。在该函数中，我使用了 Intel Perform
python - windows 认为 tkinter 没有响应
我在 python 中有一个小应用程序，除了这个小问题之外，它工作得很好:它应该连续运行一个循环，直到用户通过按钮告诉它停止，但是当我点击开始按钮时，Windows 告诉我它不是回应。现在，如果我编写
android - MediaPlayer 认为 aac* 音频文件是视频文件？
代码运行正常，但我怎么会得到这个错误日志错误日志: 08-28 08:44:24.281: E/MediaPlayer(32454): mOnVideoSizeChangedListener is
javascript - JSHint 认为 Jasmine 函数是未定义的
我有一个使用 Karma+Jasmine 和 JSHint 的 Grunt 设置。每当我在我的规范文件上运行 JSHint 时，我都会收到一系列“未定义”错误，其中大部分是针对 Jasmine 的内置
bash - Ubuntu 认为 bash 脚本是 perl
将以下代码保存到文件中，Ubuntu 14.04 正确地意识到它是 bash: #!/usr/bin/env bash awk '{print $1 $2}' my_file 然而，向 awk 添加关
python - 为什么 inspect() 认为 map 不是内置的？
以下代码返回 false import inspect print(inspect.isbuiltin(map)) 但是 map 功能在"built-in" functions下列出. 为什么会这样？
perl - 为什么 Perl 认为 -1 是真的？
这是一段常见的示例代码: while (1) { print "foo\n"; } 永远打印“foo”。 perl foo.pl foo foo foo ... 和 while (0) { p
haskell - Yesod 开发失败，认为 cabal 构建成功
我对 Haskell 比较陌生，来自 F#(一种 Microsoft 语言)。我已经从脚手架创建了一个 Yesod 项目，稍微玩了一下，调整了一些东西，但随后它停止工作，并显示此错误消息(在所有模块

行者123

个人简介

我是一名优秀的程序员,十分优秀！

作者热门文章

滴滴打车优惠券免费领取

全站热门文章

首页

博学

6Ren·AI

商城

c - "for"循环出错，我认为是内存问题