CodeforcesRound#168(Div.2)-A.LightsOut_html/css

來源：懂視網責編：小采時間：2020-11-27 15:57:34

CodeforcesRound#168(Div.2)-A.LightsOut_html/css

CodeforcesRound#168(Div.2)-A.LightsOut_html/css_WEB-ITnose:Lights Out time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Lenny is playing a game on a 3×3 grid of lights. In the beginning of the game all lights a

推薦度：

點擊下載本文 文檔為doc格式

導讀CodeforcesRound#168(Div.2)-A.LightsOut_html/css_WEB-ITnose:Lights Out time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Lenny is playing a game on a 3×3 grid of lights. In the beginning of the game all lights a

Lights Out

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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".

Sample test(s)

input

1 0 00 0 00 0 1

output

001010100

input

1 0 18 8 82 0 3

output

010011100

題目大意：現有3*3個開關，初始全為開著。切換（開變成關，關變成開）每個開關的時候，與它直接相鄰的四個方向上的開關也會切換，給出每個開關的切換次數，問最后各個開關的狀態。

解題思路：我們只需要判斷每個開關到最后總共被切換了多少次，直接判斷次數的奇偶即可判斷某個開關最后的狀態。直接遍歷每個開關，但是如果直接在原來的開關次數上加，會影響對后來的計算，所以，我們開了兩個數組，A[][]和B[][]，A是輸入的每個開關的切換次數，B是最后每個開關切換的總次數。最后在掃一遍B即可，若B[i][j]是奇數，則狀態為0（關），否則狀態為1（開）。

AC代碼：

#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define INF 0x7fffffffint a[4][4], b[4][4];int main(){ #ifdef sxk freopen("in.txt","r",stdin); #endif int n; for(int i=0; i<3; i++) for(int j=0; j<3; j++) scanf("%d", &a[i][j]); memset(b,0,sizeof(b)); for(int i=0; i<3; i++) for(int j=0; j<3; j++){ if(a[i][j]){ b[i][j] += a[i][j]; if(i > 0) b[i-1][j] += a[i][j]; if(i < 2) b[i+1][j] += a[i][j]; if(j > 0) b[i][j-1] += a[i][j]; if(j < 2) b[i][j+1] += a[i][j]; } } for(int i=0; i<3; i++){ for(int j=0; j<3; j++){ printf("%d", b[i][j]&1^1); } printf("\n"); } return 0;}

聲明：本網頁內容旨在傳播知識，若有侵權等問題請及時與本網聯系，我們將在第一時間刪除處理。TEL:177 7030 7066 E-MAIL:11247931@qq.com

CodeforcesRound#168(Div.2)-A.LightsOut_html/css

推薦度：

點擊下載本文 文檔為doc格式

標簽： it out codeforcesround#

熱門焦點

CodeforcesRound#168(Div.2)-A.LightsOut_html/css

CodeforcesRound#168(Div.2)-A.LightsOut_html/css

CodeforcesRound#168(Div.2)-A.LightsOut_html/css

最新推薦

猜你喜歡

熱門推薦