Scribd Logo
Upload

Welcome to Scribd!

  • Minesweeper

    Uploaded by

    sangamingchannels
    3 views1 page
    This C++ code counts the number of mines adjacent to each cell in a minefield. It uses an array to store the results, loops through each cell, and calls a function to increment the counts of nearby cells. It then prints the final field with numbers showing the counts or asterisks for mine locations.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C++ code counts the number of mines adjacent to each cell in a minefield. It uses an array to store the results, loops through each cell, and calls a function to increment the counts of nearby cells. It then prints the final field with numbers showing the counts or asterisks for mine locations.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    3 views1 page

    Minesweeper

    Uploaded by

    sangamingchannels
    This C++ code counts the number of mines adjacent to each cell in a minefield. It uses an array to store the results, loops through each cell, and calls a function to increment the counts of nearby cells. It then prints the final field with numbers showing the counts or asterisks for mine locations.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    #include <bits/stdc++.

    h>
    int table[201][201];
    void add(int x, int y, int n, int m) {
    int i, dx, dy;
    int D[8][2] = {{1,0},{0,1},{-1,0},{0,-1},
    {1,1},{1,-1},{-1,1},{-1,-1}};
    for(i = 0; i < 8; i++) {
    dx = D[i][0], dy = D[i][1];
    if(x + dx >= 0 && x + dx < n && y + dy >= 0 && y + dy < m) {
    table[x+dx][y+dy]++;
    }
    }
    }
    int main() {
    int n, m, Case = 0, i, j;
    char map[201][201];
    while(scanf("%d %d", &n, &m) == 2) {
    if(n == 0 && m == 0)
    break;
    if(++Case != 1) puts("");
    for(i = 0; i < n; i++)
    scanf("%s", &map[i]);
    memset(table, 0, sizeof(table));
    for(i = 0; i < n; i++)
    for(j = 0; j < m; j++)
    if(map[i][j] == '*') {
    add(i, j, n, m);
    }
    printf("Field #%d:\n", Case);
    for(i = 0; i < n; i++, puts("")) {
    for(j = 0; j < m; j++)
    if(map[i][j] == '*')
    printf("*");
    else
    printf("%d", table[i][j]);
    }
    }
    return 0;
    }

    You might also like