提交记录 #298

编译情况：编译成功

code.c: In function ‘main’:
code.c:19:9: warning: implicit declaration of function ‘scanf’ [-Wimplicit-function-declaration]
   19 |         scanf("%d%d", &number1, &number2);
      |         ^~~~~
code.c:19:9: warning: incompatible implicit declaration of built-in function ‘scanf’
code.c:1:1: note: include ‘<stdio.h>’ or provide a declaration of ‘scanf’
  +++ |+#include <stdio.h>
    1 | 
code.c:22:13: warning: implicit declaration of function ‘getchar’ [-Wimplicit-function-declaration]
   22 |             getchar();
      |             ^~~~~~~
code.c:22:13: note: ‘getchar’ is defined in header ‘<stdio.h>’; did you forget to ‘#include <stdio.h>’?
code.c:33:11: warning: implicit declaration of function ‘printf’ [-Wimplicit-function-declaration]
   33 |           printf("\n");
      |           ^~~~~~
code.c:33:11: warning: incompatible implicit declaration of built-in function ‘printf’
code.c:33:11: note: include ‘<stdio.h>’ or provide a declaration of ‘printf’
code.c:36:9: warning: incompatible implicit declaration of built-in function ‘printf’
   36 |         printf("Field #%d:\n", line++);
      |         ^~~~~~
code.c:36:9: note: include ‘<stdio.h>’ or provide a declaration of ‘printf’

固定测试点#1:

Accepted

0.001s

556 kB

固定测试点#2:

Accepted

0.001s

492 kB

额外测试点#1:

Wrong Answer

0.005s

552 kB

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

int jisuan(int a, int b, char map[1003][1003]) {
    int result = 0;
    if (map[a - 1][b - 1] == '*') result++;
    if (map[a][b - 1] == '*') result++;
    if (map[a + 1][b - 1] == '*') result++;
    if (map[a - 1][b] == '*') result++;
    if (map[a + 1][b] == '*') result++;
    if (map[a - 1][b + 1] == '*') result++;
    if (map[a][b + 1] == '*') result++;
    if (map[a + 1][b + 1] == '*') result++;
    return result;
}

int main() {
    int number1, number2;
    int line = 1;
    while (1) {
        scanf("%d%d", &number1, &number2);
        if (number1 == 0 && number2 == 0)
        {
            getchar();
            break;
        }
        char map[1003][1003];
        map[0][0] = '0';
        for (int i = 1; i < number1 + 1; i++) {
            for (int q = 1; q < number2 + 1; q++) {
                scanf(" %c", &map[i][q]);
            }
        } if (line > 1)
        {
          printf("\n");
        }
           
        printf("Field #%d:\n", line++);
        for (int i = 1; i < number1 + 1; i++) {
            for (int q = 1; q < number2 + 1; q++) {
                if (map[i][q] == '*') {
                    printf("*");
                }
                else {
                    printf("%d", jisuan(i, q, map));
                }
              
            }  printf("\n");
           
        }
       
    }
    return 0;
}