Microsoft_Task2

#include <bits/stdc++.h>
using namespace std;

#define got cout<<"YES\n"; return;
#define got0 cout<<"YES\n"; return 0;

#define bhak cout<<"NO\n"; return;
#define bhak0 cout<<"NO\n"; return 0;

#define bas cout<<"\n";

int checkAns(int i, int j, vector<pair<int, int>> &vec_pair, int k){
    for(auto pr : vec_pair){
        if((abs(pr.first-i) + abs(pr.second-j))>k){
            return 0;
        }
    }

    return 1;
}


int main() {
    // your code goes here
    vector<vector<int>> A = {{0,0,0,1}, {0,1,0,0},{0,0,1,0}, {1,0,0,0}, {0,0,0,0}};
    int k = 4;

    int n = A.size(), m = A[0].size();

    vector<pair<int, int>> vec_pair;

    for(int i=0; i<n; ++i){
        for(int j=0; j<m; ++j){
            if(A[i][j]==1){
                vec_pair.push_back({i, j});
            }
        }
    }

    int ans = 0;
    for(int i=0; i<n; ++i){
        for(int j=0; j<m; ++j){
            if(A[i][j]==0){
                ans += checkAns(i, j, vec_pair, k);
            }
        }
    }

    cout<<ans<<endl;

    return 0;
}