// Grzegorz Bukowiec // Potyczki Algorytmiczne 2018 // Runda 5B - Skwarki #include <iostream> using namespace std; int main() { int n, k; long long p; cin >> n; cin >> k; cin >> p; if (n < 13) { long long results[13][13] = { {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 4, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 8, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 16, 100, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 32, 616, 72, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 64, 4024, 952, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 128, 28512, 11680, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 256, 219664, 142800, 160, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 512, 1831712, 1788896, 7680, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 1024, 16429152, 23252832, 233792, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 2048, 157552000, 315549312, 5898240, 0, 0, 0, 0, 0, 0, 0, 0} }; cout << results[n][k] % p; } else if (k == 1) { long long result = 1; for (int i = 0; i < n - 1; ++i) { result *= 2; result %= p; } cout << result; } else if (k == 0) { cout << 0; } else { cout << 0; } 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 | // Grzegorz Bukowiec // Potyczki Algorytmiczne 2018 // Runda 5B - Skwarki #include <iostream> using namespace std; int main() { int n, k; long long p; cin >> n; cin >> k; cin >> p; if (n < 13) { long long results[13][13] = { {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 4, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 8, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 16, 100, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 32, 616, 72, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 64, 4024, 952, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 128, 28512, 11680, 0, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 256, 219664, 142800, 160, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 512, 1831712, 1788896, 7680, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 1024, 16429152, 23252832, 233792, 0, 0, 0, 0, 0, 0, 0, 0}, {0, 2048, 157552000, 315549312, 5898240, 0, 0, 0, 0, 0, 0, 0, 0} }; cout << results[n][k] % p; } else if (k == 1) { long long result = 1; for (int i = 0; i < n - 1; ++i) { result *= 2; result %= p; } cout << result; } else if (k == 0) { cout << 0; } else { cout << 0; } return 0; } |