tonirr

토마토(BFS) #include #include #include #include /* run this program using the console pauser or add your own getch, system("pause") or input loop */ using namespace std; int dx[4] = {0, 1, 0, -1}; int dy[4] = {-1, 0, 1, 0}; int k, m, n, res=-2147000000, map[1010][1010], dis[1010][1010]; struct Loc { int x; int y; Loc(int a, int b){ x = a; y = b; } }; queue Q; int main() { //freopen("input.txt", "rt..

송아지 찾기 내가짠 코드 #include #include #include /* run this program using the console pauser or add your own getch, system("pause") or input loop */ using namespace std; int ch[10000], dis[10000]; int val[] = {1, -1, 5}; int main() { //freopen("input.txt", "rt", stdin); int n, m, i, a, b, x, res, min=2147000000; vector map[10000]; queue Q; scanf("%d %d", &n, &m); Q.push(n); ch[n]=1; while(!Q.empty()){ ..

이진트리 넓이우선탐색(BFS) #include #include /* run this program using the console pauser or add your own getch, system("pause") or input loop */ using namespace std; int Q[100], front=-1, back=-1, ch[10]; vector map[10]; int main() { freopen("input.txt", "rt", stdin); int i, a, b, x; for(i=1; i