맛있는감귤

문제 : https://www.acmicpc.net/problem/1009 github : https://github.com/JEONG-SEUNGWOOK/BOJ/blob/master/1009.cpp #include #include using namespace std; int main(){ int T; scanf("%d",&T); for(int testcase=1; testcase

문제 : https://www.acmicpc.net/problem/1012 github : https://github.com/JEONG-SEUNGWOOK/BOJ/blob/master/1012.cpp 일반적인 DFS, BFS 문제. DFS로 간단하게 해결. #include using namespace std; int T,N,M,K; bool map[51][51]; bool isVisited[51][51]; int dx[4]={1,-1,0,0}; int dy[4]={0,0,1,-1}; void dfs(int x, int y){ for(int i=0;i=0 && nx=0 && ny