 # CODE_BELT - SSEC0025

problem:
A country is divided into R*C cities .The chef wants find the cities which are dominated by coders. Each city may or may not have coders residing in it. If the city is dominated by coders, it is marked with 1 else it is marked with 0. Two cities are termed as connected cities if they both are dominated by coders and can be reached by moving vertically, horizontally, or diagonally.
One or more coder dominant connected cities form the Coding belt. In a belt, there may be coder dominant cities which are not directly connected but can be reached by moving through other dominant cities. It is possible that there are multiple coding belts in the state.

solution:
#include
using namespace std;

int visited;
int arr;
int m,n;

bool isvalid(int x, int y){
if(x < 1 || y < 1 || x > m || y > n){
return false;
}
if(visited[x][y]){
return false;
}
return true;
}

int dx[] ={-1,-1,0,1,1,1,0,-1};
int dy[] ={0,1,1,1,0,-1,-1,-1};

void dfs(int x,int y,int &count){
visited[x][y] = 1;
for(int i = 0; i < 8; i++){
if(isvalid(x + dx[i],y + dy[i]) && arr[x + dx[i]][y + dy[i]] == 1){
count++;
dfs(x + dx[i], y + dy[i], count);
}
}
}
int main() {
cin>>m>>n;

``````for(int i = 1; i <=m; i++){
for(int j = 1; j <= n; j++){
cin>>arr[i][j];
}
}

int ans = 0, coders = 1;
for(int i = 1; i <= m; i++){
for(int j = 1; j <= n; j++){
if(visited[i][j] == 0 && arr[i][j] == 1){
dfs(i,j,coders);
ans = max(ans, coders);
coders = 1;
}
}
}
cout << ans;

return 0;
``````

}