Minesweeper.java
public class
Minesweeper
{
public static void main(String[] args)
{
int M = Integer.parseInt(args[0]);
int N = Integer.parseInt(args[1]);
double p = Double.parseDouble(args[2]);
boolean[][] bombs = new
boolean[M+2][N+2];
for (int i = 1; i <= M; i++)
for (int j = 1; j <= N; j++)
bombs[i][j] = (Math.random() < p);
for (int i = 1; i <= M; i++)
{
for (int j = 1; j <= N; j++)
if (bombs[i][j])
System.out.print("* ");
else
System.out.print(". ");
System.out.println();
}
int[][] sol = new int[M+2][N+2];
for (int i = 1; i <= M; i++)
for (int j = 1; j <= N; j++)
for (int ii = i - 1; ii <= i +
1; ii++)
for (int jj = j - 1; jj <= j
+ 1; jj++)
if (bombs[ii][jj])
sol[i][j]++;
System.out.println();
for (int i = 1; i <= M; i++)
{
for (int j = 1; j <= N; j++)
if (bombs[i][j])
System.out.print("* ");
else System.out.print(sol[i][j] +
" ");
System.out.println();
}
}
}
No comments:
Post a Comment