(BOJ) 2667 풀이
#include #include #include using namespace std; int map[26][26]={0,}; int visit[26][26]={0,}; int yy[]={0,-1,0,1}; int xx[]={-1,0,1,0}; int N; int DFS(int y,int x,int c){ if (y = N || x >= N || map[y][x] == 0) return 0; visit[y][x]=1; for(int asdf=0;asdf
2022. 1. 11.
