#include #include using namespace std;;bool map[27][27];bool visit[27][27];int num[313];int cnt_d;int cnt;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> N; char in[25]; for(int i=1; i> in; for(int j=1; j
#include using namespace std;int M, N, K;bool map[51][51];int visit[51][51]; int dx[4]={1, -1, 0, 0};int dy[4]={0, 0, 1, -1}; int cnt; void dfs(int x, int y){ for(int i=0; i=0 && nx=0 && ny> T; for(int tc=0; tc> M >> N >> K; //initialize for(int i=0; i> y; map[y][x]=1;} for(int i=0; i
#include #include #include using namespace std;int N, K; int bfs(void){ queue q; bool visit[100001]={0}; // 범위 주의 q.push({N,0}); while(!q.empty()) { int x = q.front().first; int t = q.front().second; q.pop(); if(x100000) continue; if(visit[x]) continue; visit[x]=1; if(x==K) return t; q.push({x*2,t+1}); q.push({x+1,t+1}); q.push({x-1,t+1}); }} int main(){ scanf("%d %d", &N, &K); printf("%..
#include #include #include #include using namespace std; int visit[1001];bool graph[1001][1001];int N,M,V; void BFS(int curr){ queue q; q.push(curr); if(visit[curr]) return; while(!q.empty()) { curr = q.front(); if(visit[curr]==0) printf("%d ",curr); visit[curr]=1; q.pop(); for(int i=1; i
