提交记录 #263

提交时间：2024-11-18 21:14:18
语言：c 状态：Unaccepted
编译情况：编译成功 
code.c: In function ‘main’:
code.c:89:29: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   89 |                     else if(i=0&&j==0){
      |                             ^
code.c:8:10: warning: unused variable ‘k’ [-Wunused-variable]
    8 |     char k;
      |          ^
code.c:106:25: warning: array subscript -1 is below array bounds of ‘char[1000][100]’ [-Warray-bounds]
  106 |                     if(a[i-1][j+1]=='*')
      |                        ~^~~~~
code.c:4:6: note: while referencing ‘a’
    4 | char a[1000][100];
      |      ^
code.c:108:25: warning: array subscript -1 is below array bounds of ‘char[1000][100]’ [-Warray-bounds]
  108 |                     if(a[i-1][j]=='*')
      |                        ~^~~~~
code.c:4:6: note: while referencing ‘a’
    4 | char a[1000][100];
      |      ^
固定测试点#1:
tleTime Limit Exceeded
time N/A
memory N/A
固定测试点#2:
tleTime Limit Exceeded
time N/A
memory N/A
附加测试点暂不可用
... 不可用
time N/A
memory N/A

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

#include <stdio.h>
#include <string.h>
char a[1000][100];
char d[1000];
int main(int argc, char** argv) {
    int n,m,t,i,j,s;
    char k;
    for(t=1;t>=0;t++){
        scanf("%d %d",&n,&m);
        if(n==0&&m==0)
        break;
        if(t!=1) printf("\n");
        char b[n][m];
        for(i=0;i<n;i++){
            scanf("%s",a[i]);
        }
        for(i=0;i<n;i++){
            for(j=0;j<m;j++){
                if(a[i][j]=='*')
                b[i][j] = '*';
                else if(a[i][j]=='.'){
                    s=0;
                    if(i!=0&&j!=0&&i!=n-1&&j!=n-1){
                    if(a[i-1][j]=='*')
                    s++;
                    if(a[i-1][j+1]=='*')
                    s++;
                    if(a[i][j-1]=='*')
                    s++;
                    if(a[i][j+1]=='*')
                    s++;
                    if(a[i+1][j-1]=='*')
                    s++;
                    if(a[i+1][j]=='*')
                    s++;
                    if(a[i+1][j+1]=='*')
                    s++;
                    
                }
                    else if(i==0&&j!=0&&j!=m-1){
                        if(a[i][j-1]=='*')
                    s++;
                    if(a[i][j+1]=='*')
                    s++;
                    if(a[i+1][j-1]=='*')
                    s++;
                    if(a[i+1][j]=='*')
                    s++;
                    if(a[i+1][j+1]=='*')
                    s++;
                    }
                    else if(i!=0&&i!=n-1&&j==0){
                        if(a[i-1][j]=='*')
                    s++;
                    if(a[i-1][j+1]=='*')
                    s++;
                    if(a[i][j+1]=='*')
                    s++;
                    if(a[i+1][j]=='*')
                    s++;
                    if(a[i+1][j+1]=='*')
                    s++;
                    }
                    else if(i==n-1&&j!=0&&j!=m-1){
                        if(a[i-1][j-1]=='*')
                    s++;
                    if(a[i-1][j]=='*')
                    s++;
                    if(a[i-1][j+1]=='*')
                    s++;
                    if(a[i][j-1]=='*')
                    s++;
                    if(a[i][j+1]=='*')
                    s++;
                    }
                    else if(j==m-1&&i!=0&&i!=n-1){
                    if(a[i-1][j-1]=='*')
                    s++;
                    if(a[i-1][j]=='*')
                    s++;
                    if(a[i][j-1]=='*')
                    s++;
                    if(a[i+1][j-1]=='*')
                    s++;
                    if(a[i+1][j]=='*')
                    s++;
                    }
                    else if(i=0&&j==0){
                        if(a[i+1][j]=='*')
                    s++;
                    if(a[i+1][j+1]=='*')
                    s++;
                    if(a[i][j-1]=='*')
                    s++;
                    }
                    else if(i==0&&j==m-1){
                    if(a[i][j-1]=='*')
                    s++;
                    if(a[i+1][j-1]=='*')
                    s++;
                    if(a[i+1][j]=='*')
                    s++;
                    }
                    else if(i==n-1&&j==0){
                    if(a[i-1][j+1]=='*')
                    s++;
                    if(a[i-1][j]=='*')
                    s++;
                    if(a[i][j+1]=='*')
                    s++;
                    }
                    else if(i==n-1&&j==m-1){
                        if(a[i-1][j-1]=='*')
                    s++;
                    if(a[i][j-1]=='*')
                    s++;
                    if(a[i-1][j]=='*')
                    s++;
                    }
                    b[i][j]=s+48;
                }
            }
            b[i][m+1] = '\0';
        }
        printf("Field #%d:\n",t);
        for(i=0;i<n;i++){
            for(j=0;j<m;j++){
                printf("%c",b[i][j]);
            }
            printf("\n");
        }
}
}
京ICP备2024093084 号