#include <iostream> using namespace std; long long n, m, p; bool **array; void printArray() { cout << endl; for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { cout << (array[i][j] ? 'X' : '.'); } cout << endl; } cout << endl; } bool isCorrect() { bool flag; for (int j = 0; j < n - 1; ++j) { flag = false; for (int i = 0; i < m; ++i) { if (array[i][j] && array[i][j + 1]) { flag = true; break; } } if (!flag) { return false; } } return true; } bool getNextSet() { int i = 0; while (array[i / n][i % n]) { array[i / n][i % n] = false; ++i; if (i == m * n) { return false; } } array[i / n][i % n] = true; return true; } int main() { ios_base::sync_with_stdio(0); cin >> n; cin >> m; cin >> p; array = new bool*[m]; for (int i = 0; i < m; ++i) { array[i] = new bool[n]; for (int j = 0; j < n; ++j) { array[i][j] = false; } } long long result = 0; while(true) { // printArray(); if (isCorrect()) { result = (result + 1) % p; } if (!getNextSet()) { break; } } cout << result << endl; for (int i = 0; i < m; ++i) { delete [] array[i]; } delete [] array; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 | #include <iostream> using namespace std; long long n, m, p; bool **array; void printArray() { cout << endl; for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { cout << (array[i][j] ? 'X' : '.'); } cout << endl; } cout << endl; } bool isCorrect() { bool flag; for (int j = 0; j < n - 1; ++j) { flag = false; for (int i = 0; i < m; ++i) { if (array[i][j] && array[i][j + 1]) { flag = true; break; } } if (!flag) { return false; } } return true; } bool getNextSet() { int i = 0; while (array[i / n][i % n]) { array[i / n][i % n] = false; ++i; if (i == m * n) { return false; } } array[i / n][i % n] = true; return true; } int main() { ios_base::sync_with_stdio(0); cin >> n; cin >> m; cin >> p; array = new bool*[m]; for (int i = 0; i < m; ++i) { array[i] = new bool[n]; for (int j = 0; j < n; ++j) { array[i][j] = false; } } long long result = 0; while(true) { // printArray(); if (isCorrect()) { result = (result + 1) % p; } if (!getNextSet()) { break; } } cout << result << endl; for (int i = 0; i < m; ++i) { delete [] array[i]; } delete [] array; return 0; } |