Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- #include <vector>
- #include <queue>
- #include <algorithm>
- #include <string>
- #include <stack>
- #include <set>
- #include <map>
- #define pii pair <int, int>
- #define pb(x) push_back(x)
- using namespace std;
- using ll = long long;
- using ld = long double;
- using db = double;
- void cv(vector <int> &v) {
- for (auto x : v) cout << x << ' ';
- cout << "\n";
- }
- void cvl(vector <ll> &v) {
- for (auto x : v) cout << x << ' ';
- cout << "\n";
- }
- void cvv(vector <vector <int> > &v) {
- for (auto x : v) cv(x);
- cout << "\n";
- }
- void cvb(vector <bool> v) {
- for (bool x : v) cout << x << ' ';
- cout << "\n";
- }
- void cvs(vector <string> v) {
- for (auto a : v) {
- cout << a << "\n";
- }
- }
- void cvp(vector <pii> a) {
- for (auto p : a) {
- cout << p.first << ' ' << p.second << "\n";
- }
- cout << "\n";
- }
- vector <vector <int> > m;
- vector <int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
- bool ok(int i, int j) {
- return i >= 0 && j >= 0 && i < 8 && j < 8 && m[i][j] == 0;
- }
- bool sh = 0;
- void bld() {
- m.assign(8, vector <int> (8, 0));
- for (int i = 1; i <= 4; ++i) {
- m[i][1] = 1;
- }
- for (int i = 3; i <= 6; ++i) {
- m[i][6] = 1;
- }
- }
- int cnt;
- void go(int i, int j) {
- m[i][j] = 1;
- cnt++;
- if (sh) {
- cout << i << ' ' << j << "\n";
- }
- for (int k = 0; k < 4; ++k) {
- int x = i + dx[k];
- int y = j + dy[k];
- if (ok(x, y)) {
- go(x, y);
- break;
- }
- }
- }
- int main() {
- ios::sync_with_stdio(0);
- cin.tie(0);
- cout.tie(0);
- int ans = 0;
- //sh = 1;
- for (int i = 0; i < 8; ++i) {
- for (int j = 0; j < 8; ++j) {
- bld();
- cnt = 0;
- if (!ok(i, j)) {
- continue;
- }
- if (sh) {
- cout << "GO i j = " << i << ' ' << j << "\n";
- }
- go(i, j);
- if (cnt == 56) {
- cout << i << ' ' << j << "\n";
- ans++;
- }
- }
- }
- cout << "ans = " << ans << "\n";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement