Nonogram solver
| Revision | df59144a643bd8ffc984037ce2a6edd2507c0d58 (tree) |
|---|---|
| Time | 2021-03-06 04:05:45 |
| Author |  Alexander Larin <scalar438@gmai...> |
| Commiter | Alexander Larin |
clang-format
| @@ -79,7 +79,7 @@ | ||
| 79 | 79 | for (auto &vec : vecs) |
| 80 | 80 | { |
| 81 | 81 | vector<Block> blocks; |
| 82 | - for(auto val : vec) | |
| 82 | + for (auto val : vec) | |
| 83 | 83 | blocks.emplace_back(Block(1, val)); |
| 84 | 84 | res.emplace_back(std::move(blocks)); |
| 85 | 85 | } |
| @@ -92,18 +92,19 @@ | ||
| 92 | 92 | const char arr[3] = {'.', 'X', '?'}; |
| 93 | 93 | vector<int> vs(n); |
| 94 | 94 | vector<string> res; |
| 95 | - while(1) | |
| 95 | + while (1) | |
| 96 | 96 | { |
| 97 | 97 | string str; |
| 98 | - for(int v : vs) str.push_back(arr[v]); | |
| 98 | + for (int v : vs) | |
| 99 | + str.push_back(arr[v]); | |
| 99 | 100 | res.emplace_back(std::move(str)); |
| 100 | 101 | int i = 0; |
| 101 | - while(i != n && vs[i] == 2) | |
| 102 | + while (i != n && vs[i] == 2) | |
| 102 | 103 | { |
| 103 | 104 | vs[i] = 0; |
| 104 | 105 | ++i; |
| 105 | 106 | } |
| 106 | - if(i == n) break; | |
| 107 | + if (i == n) break; | |
| 107 | 108 | ++vs[i]; |
| 108 | 109 | } |
| 109 | 110 | return res; |
| @@ -111,8 +112,8 @@ | ||
| 111 | 112 | |
| 112 | 113 | int main() |
| 113 | 114 | { |
| 114 | - const int n = 7; | |
| 115 | + const int n = 7; | |
| 115 | 116 | auto all_blocks = gen_all_blocks(n); |
| 116 | - auto all_rows = gen_all_rows(n); | |
| 117 | + auto all_rows = gen_all_rows(n); | |
| 117 | 118 | std::cout << all_blocks.size() * all_rows.size(); |
| 118 | 119 | } |
| \ No newline at end of file |
Fork
main.cpp