백준 1987번: 알파벳 C++코드(DFS, Backtracking, 백트래킹)
#include #include using namespace std; int alphabet[26] = {0,}; char graph[21][21] = {0,}; int r,c; int result = 0; int y[4] = {0,0,-1,1}; int x[4] = {-1,1,0,0}; void dfs(int ny, int nx, int cnt){ if(result c; for(int i=0; i graph[i][j]; } } alphabet[graph[0][0]-65] = 1; dfs(0,0,1); cout
백준 1926번: 그림 C++코드(BFS)
#include #include #include #include #include using namespace std; int n,m; int picture[501][501]; int visit[501][501] = {0,}; int x[4] = {0,0,1,-1}; int y[4] = {1,-1,0,0}; int bfs(int s1, int s2){ int funcnt = 0; queue q; q.push(make_pair(s1,s2)); while(!q.empty()){ funcnt += 1; pair now = q.front(); q.pop(); for(int i=0; i> m; vector v; v.push_back(0); for(int i=0; i picture[i][j]; } } for(int ..