Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "pch.h"
- #include <iostream>
- #include <thread>
- /*
- const static int sudSize = 9;
- const int count(int* list, int item) {
- int n = 0;
- for (int i = 0; i < sudSize; i++)
- if (list[i] == item)
- n++;
- return n;
- }
- const void validateRow(int* row, int id) {
- for (int i = 0; i < sudSize; i++)
- // if an item is not exactly 1x present in list, return false
- if (count(row, row[i]) != 1) {
- std::cout << "Row " << id << " is incorrect." << std::endl;
- return;
- }
- }
- */
- int main()
- {
- /*const int sudoku[sudSize][sudSize] = {
- {1, 2, 3, 4, 5, 6, 7, 8, 9},
- {9, 1, 2, 3, 4, 5, 6, 7, 8},
- {8, 9, 1, 2, 3, 4, 5, 6, 7},
- {7, 8, 9, 1, 2, 3, 4, 5, 6},
- {6, 7, 8, 9, 1, 2, 3, 4, 5},
- {5, 6, 7, 8, 9, 1, 2, 3, 4},
- {4, 5, 6, 7, 8, 9, 1, 2, 3},
- {3, 4, 5, 6, 7, 8, 9, 1, 2},
- {2, 3, 4, 5, 6, 7, 8, 9, 1}
- };
- std::thread t[sudSize];
- for (int i = 0; i < sudSize; i++)
- t[i] = std::thread(validateRow, sudoku[i]);
- for (int i = 0; i < sudSize; i++)
- t[i].join();*/
- std::cout << "test";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement