Question

Please use Java for this question.

​​​​​​​

Input Format Format for Custom Testing Input from stdin will be processed as follows and passed to the function In the first line, there is a single integer n. In the second line, there is a single integer m. In the ph of the next n lines there are m space-separated integers denoting the throw of the initial grid. In the next line, there is a single integer k. In the next line, there is a single integer 9. After that, 9 lines follow, the oth of them, indexed from 0, denotes the oth rule of the game. Sample Case 0 Sample Input 010 dead alive dead dead dead dead dead dead dead dead Sample Output 1010 illo Explanation The game is played on a grid with 2 rows and 4 columns. The cell at grid[0][1] is the only alive cell initially and k = 1 step is performed. The rules specify that all cells with exactly 1 alive neighbor become alive, and all others cell become dead. This determines that the only alive cell becomes dead, its neighbors become alive, and all remaining cells become dead.

Answer 1

Answer:-

'''

Python version : 3.6

'''

# The function is expected to return a 2D_INTEGER_ARRAY

# The function accepts the following parameters:

# 1. 2D_INTEGER_ARRAY grid

# 2. INTEGER k

# 3. STRING_ARRAY rules

def gridGame(grid, k, rules):

  

# create outGrid of same elements as grid

outGrid = [[grid[i][j] for j in range(len(grid[i]))] for i in range(len(grid))]

  

# loop that runs k times

for i in range(k):

# create a tempGrid the contains the same elements as outGrid

tempGrid = [[outGrid[i][j] for j in range(len(outGrid[i]))] for i in range(len(outGrid))]

# loop that updates each cell of tempGrid

for row in range(len(tempGrid)):

for col in range(len(tempGrid[row])):

# call the function to calculate the number of alive neighbors

aliveNeighbors = countAliveNeighbors(outGrid,row,col)

# if the rules for that number of alive neighbours is alive set it to 1

if rules[aliveNeighbors] == "alive":

tempGrid[row][col] = 1

else: # if rule is dead set it to 0

tempGrid[row][col] = 0

# copy the tempGrid elements to outGrid

outGrid = [[tempGrid[i][j] for j in range(len(tempGrid[i]))] for i in range(len(tempGrid))]

return outGrid # return the outGrid

# function that calculates and returns the number of alive neighbors for specified row and col

# the function accepts the following parameters as inputs:

# 1. 2D_INTEGER_ARRAY grid

# 2. INTEGER row

# 3. INTEGER col

def countAliveNeighbors(grid, row, col):

  

count = 0

if((row -1) >= 0):

if(((col-1) >= 0) and (grid[row-1][col-1] == 1)):

count += 1

if(grid[row-1][col] == 1):

count += 1

if((col+1) < len(grid[row])) and (grid[row-1][col+1] == 1):

count += 1

if((col-1) >= 0 and (grid[row][col-1] == 1)):

count += 1

if((col+1) < len(grid[row]) and grid[row][col+1] == 1):

count += 1

if((row+1) < len(grid)):

if(((col-1) >= 0) and (grid[row+1][col-1] == 1)):

count += 1

if(grid[row+1][col] == 1):

count += 1

if((col+1) < len(grid[row])) and (grid[row+1][col+1] == 1):

count += 1

return count

  

# main function

if __name__ == "__main__":

  

# read the value fro n and m

n = int(input(''))

m = int(input(''))

# create a grid of n rows and m columns and set the elements to 0

grid = [[0 for i in range(m)] for j in range(n)]

  

# loop to read the values for the grid

for i in range(n):

line = input('')

line_list = line.split()

for j in range(m):

grid[i][j] = int(line_list[j])

  

# read the value for k   

k = int(input(''))

  

# read 9

numRules = int(input(''))

  

# read the 9 values for rules

rules = ["" for i in range(numRules)]

for i in range(numRules):

rules[i] = input('')

rules[i] = rules[i].strip()

  

# call and get the modified grid

mod_grid = gridGame(grid,k,rules)

  

# output the resultant grid

print(mod_grid)

  

#end of program