minefield/main.c at master · grvela/minefield · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <stdbool.h>

#define N 20

bool Q = false;
int W = 0;
int B;

void preenche_matriz(char M[][N], int n);
void sorteia_bombas(char M[][N], int n);
void imprime_mat(char M[][N], int n);
void checa_jogada(char M[][N], int n);
void checa_numero(char M[][N], int n, int x, int y);
int n_bombas(int i, int c, char M[][N], int n);
int percorre_matriz(char M[][N], int ip, int iq, int fp, int fq);

int main(void) {
  int n;
  char M[N][N];
  printf("Defina o tamanho da matriz: ");
  scanf("%d", &n);
  preenche_matriz(M, n);
  sorteia_bombas(M, n);
  imprime_mat(M, n);
  do{
    W++;
    checa_jogada(M, n);
    imprime_mat(M, n);
  }while(!Q);
}


int percorre_matriz(char M[][N], int ip, int iq, int fp, int fq){
  int x = 0;
  for(int i = ip; i < fp; i++){
    for(int j = iq; j < fq; j++){
      if(M[i][j] == '*') x++;
    }
  }
  return x;
}

int n_bombas(int l, int c, char M[][N], int n){
  int x;
  if(l == 0 && c == 0) x = percorre_matriz(M, l, c, 2, 2);
  if(l == n - 1 && c == 0) x = percorre_matriz(M, l - 1, c, n, 2);
  if(l == 0 && c == n - 1) x = percorre_matriz(M, l, c - 1, 2, n);
  if(l == n - 1 && c == n - 1) x = percorre_matriz(M,  l - 1, c - 1, n, n);
  if(l == 0 && (c > 0 && c < n - 1)) x = percorre_matriz(M, l, c - 1, l + 2, c + 2);
  if(l == n - 1 && (c > 0 && c < n - 1)) x = percorre_matriz(M, l - 1, c - 1, l + 2, c + 2);
  if(c == 0 && (l > 0 && l < n - 1)) x = percorre_matriz(M, l - 1, c, l + 2, c + 2);
  if(c == n - 1 && (l > 0 && l < n - 1)) x = percorre_matriz(M, l - 1, c - 1, l + 2, c + 1);
  if((l > 0 && l < n - 1) && (c > 0 && c < n -1)) x = percorre_matriz(M, l - 1, c - 1, l + 2, c + 2);
  return x;
}

void checa_numero(char M[][N], int n, int x, int y){
  int r;
  r = n_bombas(x, y, M, n);
  M[x][y] = r + '0';
}

void checa_jogada(char M[][N], int n){
  int x, y;
  printf("\nDigite a linha e coluna desejada: ");
  scanf("%d %d", &x, &y);
  if((x < 1 || x > n) || (y < 1 || y > n)){
    printf("Entrada invalida\n");
    W--;
  }else{
    x--;
    y--;
    if(M[x][y] == '*') {
      Q = true;
      printf("\nVOCE PERDEU! FIM DE JOGO.\n\n");
    }else{
      if(M[x][y] != '?') {
      W--;
    }else{
      if(W == ((n*n) - B)){
        Q = true;
        printf("PARABENS! VOCE VENCEU!\n\n");
        checa_numero(M, n, x, y);
      }else{
        checa_numero(M, n, x, y);
      }
    }
    }
  }
}

void imprime_mat(char M[][N], int n){
   for(int i = 0; i < n; i++){
    if(n > 9 && i < 9) printf(" %d |", i + 1);
    else printf("%d |", i + 1);
    for(int j = 0; j < n; j++){
      if(M[i][j] == '*' && !Q) printf(" ? ");
      else printf(" %c ", M[i][j]);
    }
    printf("\n");
  }
  for(int i = 0; i < 2; i++){
    if(n > 9) printf("    ");
    else printf("   ");
    for(int j = 0; j < n; j++){
      if(i == 0) printf("---");
      else {
        if(n > 9 && j > 8) printf(" %d", j + 1);
        else printf(" %d ", j + 1);
        }
    }
    printf("\n");
  }
}

void sorteia_bombas(char M[][N], int n){
  srand(time(NULL));
  int x, y;
  B = 0.2 * (n * n);
  for(int i = 0; i < B; i++){
    x = rand() % n;
    y = rand() % n;
    if(M[x][y] == '*'){
      do{
        x = rand() % n;
        y = rand() % n;
      }while(M[x][y] == '*');
      M[x][y] = '*';
    }else M[x][y] = '*';
  }
}

void preenche_matriz(char M[][N], int n){
  for(int i = 0; i < n; i++){
    for(int j = 0; j < n; j++){
      M[i][j] = '?';
    }
  }
}