提交记录 #271

编译情况：编译成功

code.c: In function ‘main’:
code.c:11:17: warning: format ‘%d’ expects argument of type ‘int *’, but argument 2 has type ‘short int *’ [-Wformat=]
   11 |         scanf("%d %d",&n[k],&m[k]);
      |                ~^     ~~~~~
      |                 |     |
      |                 int * short int *
      |                %hd
code.c:11:20: warning: format ‘%d’ expects argument of type ‘int *’, but argument 3 has type ‘short int *’ [-Wformat=]
   11 |         scanf("%d %d",&n[k],&m[k]);
      |                   ~^        ~~~~~
      |                    |        |
      |                    int *    short int *
      |                   %hd

固定测试点#1:

Accepted

0.040s

556 kB

固定测试点#2:

Runtime Error: ./code.exe: error while loading shared libraries: libc.so.6: cannot create shared object descriptor: Cannot allocate memory - Returning:127

0.000s

N/A

附加测试点暂不可用

不可用

N/A

40【游戏】扫雷:如此传统的游戏，你现在就可以动手来开发

#include<stdio.h>
#include<string.h>
short int n[1000],m[1000],a[100][100][2][1000]={0};
int main()
{
    short int i,j,k=0,K;
    char str[100];
    for(;;)
    {
        scanf("%d %d",&n[k],&m[k]);
        if(n[k]==0||m[k]==0)
        {
            /*printf("n=%d,m=%d\n",n[k],m[k]);*/break;
        }
        scanf("\n");
        for(i=1;i<=n[k];i++)
        {
            //printf("n=%d,m=%d\n",n[k],m[k]);
            scanf(" %s",str);
            for(j=1;j<=m[k];j++)
            {
                if(str[j-1]=='*')
                {
                    a[i][j][0][k]=1;
                }
                else
                {
                    a[i][j][0][k]=0;
                }
            }
        }
        for(i=1;i<=n[k];i++)
        {
            for(j=1;j<=m[k];j++)
            {
                if(a[i][j][0][k]==0)
                {
                    a[i][j][1][k]=a[i-1][j-1][0][k]+a[i-1][j][0][k]+a[i-1][j+1][0][k]+a[i][j-1][0][k]+a[i][j+1][0][k]+a[i+1][j-1][0][k]+a[i+1][j][0][k]+a[i+1][j+1][0][k];
                }
                else
                {
                    a[i][j][1][k]=42;
                }
            }
        }
        /*for(i=1;i<=n;i++)
        {
            for(j=1;j<=m;j++)
            {
                printf("%d ",a[i][j][0][k]);
            }
            printf("\n");
        }*/
        /*printf("Field #%d:\n",k+1);
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=m;j++)
            {
                if(a[i][j][1][k]!=42)
                {
                    printf("%d",a[i][j][1][k]);
                }
                else
                {
                    printf("%c",a[i][j][1][k]);
                }
                
            }
            printf("\n");
        }*/
        k=k+1;
    }
    K=k;
    for(k=0;k<K;k++)
    {
        printf("Field #%d:\n",k+1);
        for(i=1;i<=n[k];i++)
        {
            for(j=1;j<=m[k];j++)
            {
                if(a[i][j][1][k]!=42)
                {
                    printf("%d",a[i][j][1][k]);
                }
                else
                {
                    printf("%c",a[i][j][1][k]);
                }
            }
            printf("\n");
        }
        if(k<K-1){printf("\n");}
    }
    return 0;    
}
/*
3 4
..*.
**..
.*..
5 6
**...*
.*....
......
*****.
*.*.*.
0 0
*/