diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2022-11-05 01:28:02 +0200 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2022-11-05 01:28:02 +0200 |
| commit | c52b36c6a37fdb1d1de146d3939cb42e2c691f44 (patch) | |
| tree | b13bbc546bf9505c875dde5d26424d39d23054c9 /codeforces/LightsOut/main.cpp | |
| parent | b79a55ceee2f4532ef6621f9d86c6c61543ce6c9 (diff) | |
| download | competitive-programming-c52b36c6a37fdb1d1de146d3939cb42e2c691f44.tar.xz competitive-programming-c52b36c6a37fdb1d1de146d3939cb42e2c691f44.zip | |
Solved 6 problem in filtrationContest and restructured the repo
Diffstat (limited to 'codeforces/LightsOut/main.cpp')
| -rw-r--r-- | codeforces/LightsOut/main.cpp | 47 |
1 files changed, 47 insertions, 0 deletions
diff --git a/codeforces/LightsOut/main.cpp b/codeforces/LightsOut/main.cpp new file mode 100644 index 0000000..6b49d5d --- /dev/null +++ b/codeforces/LightsOut/main.cpp @@ -0,0 +1,47 @@ +#include<bits/stdc++.h> + +using namespace std; + +bool safeMove(int i, int j) { + if(i < 0 || i > 2 || j < 0 || j > 2) { + return false; + } + return true; +} + +vector<vector<int>> sumAdjacents(vector<vector<int>> v) { + vector<vector<int>> ans(3, vector<int> (3)); + vector<int> dx = {1, 0, -1, 0}; + vector<int> dy = {0, 1, 0, -1}; + for(int i = 0; i < v.size();i++) { + for(int j = 0; j < v[i].size(); j++) { + ans[i][j] += v[i][j]; + for(int k = 0; k < 4; k++) { + int x = i + dx[k]; + int y = j + dy[k]; + if(safeMove(x, y)) { + ans[i][j] += v[x][y]; + } + } + (ans[i][j] & 1) ? ans[i][j] = 0 : ans[i][j] = 1; + } + } + return ans; +} + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + vector<vector<int>> v (3, vector<int> (3)); + for(auto &x : v) { + for(auto &y : x) { + cin >> y; + } + } + for(auto x : sumAdjacents(v)) { + for(auto z : x) { + cout << z; + } + cout << endl; + } +} |
