HarshCasper / NeoAlgo

Bringing all Data Structures and Algorithms under one Roof āš”
MIT License
875 stars 1.05k forks source link

Lights Out #4097

Closed JASKAMAL22 closed 3 years ago

JASKAMAL22 commented 3 years ago

šŸ’„ Proposal

Lenny is playing a game on a 3ā€‰Ć—ā€‰3 grid of lights. In the beginning of the game all lights are switched on. Pressing any of the lights will toggle it and all side-adjacent lights. The goal of the game is to switch all the lights off. We consider the toggling as follows: if the light was switched on then it will be switched off, if it was switched off then it will be switched on.

Lenny has spent some time playing with the grid and by now he has pressed each light a certain number of times. Given the number of times each light is pressed, you have to print the current state of each light.

Input The input consists of three rows. Each row contains three integers each between 0 to 100 inclusive. The j-th number in the i-th row is the number of times the j-th light of the i-th row of the grid is pressed.

Output Print three lines, each containing three characters. The j-th character of the i-th line is "1" if and only if the corresponding light is switched on, otherwise it's "0".

Example: INPUT 1 0 0 0 0 0 0 0 1 OUTPUT 001 010 100

(A clear and concise description of what the proposal is.) Provide the python source code for the above program with a concise description.

Have you read the Contributing Guidelines on Pull Requests?

(yes)

As a part of gssoc21

github-actions[bot] commented 3 years ago

Hello @JASKAMAL22,
Thank you for opening an issue. :partying_face:
To get assigned to this particular issue please use /assign
Check this guide before contributing.

JASKAMAL22 commented 3 years ago

/assign

github-actions[bot] commented 3 years ago

This issue has been assigned to @JASKAMAL22! It will become unassigned if it isn't closed within 21 days. A maintainer can also add the pinned label to prevent it from being unassigned.