youtu.be/Q6pa2akgUGI [섬의 개수 정답 코드] #include #include using namespace std; int field[51][51]; int visited[51][51]; //팔방 check int dx[] = { 0,0,-1,1,-1,1,-1,1}; int dy[] = { -1,1,0,0,-1,1,1,-1 }; int n, m; queue q; void bfs(int x, int y,int cnt); int main() { ios_base::sync_with_stdio(0); cin.tie(0); while (1) { int cnt = 1; cin >> n >> m; if (n == 0 && m == 0) return 0; for (int i = 0; i < m; i++..
※ hackernoon.com/facial-similarity-with-siamese-networks-in-pytorch-9642aa9db2f7의 도움을 아주 많이 받았습니다. Facial Similarity with Siamese Networks in PyTorch | Hacker Noon Facial Similarity with Siamese Networks in PyTorch This is Part 2 of a two part article. You should read part 1 before continuing here. In the last article discussed the class of problems that one shot learning aims to solve, and how ..
[문제 풀이] 영상 참고. www.youtube.com/watch?v=I0Dq42C0h8w&feature=youtu.be&ab_channel=%EC%B2%9C%EC%88%98%ED%99%98 [코드] #include #include using namespace std; int n, m, ans = 0; int field[8][8]; int clone_field[8][8]; int dx[] = { 0,0,-1,1 }; int dy[] = { -1,1,0,0 }; //바이러스를 퍼트림. void bfs(); //a field에 b field를 복사함. void clone_it(int(*a)[8], int(*b)[8]); //세개의 벽을 세움. void make_wall(int cnt); int main() ..
[문제 풀이] 영상 참고 www.youtube.com/watch?v=I0Dq42C0h8w&feature=youtu.be&ab_channel=%EC%B2%9C%EC%88%98%ED%99%98 [코드] #include #include #include #include using namespace std; int dx[] = { -1,1,0,0 }; int dy[] = { 0,0,-1,1 }; int field[101][101] = { 0, }; int visited[101][101] = { 0, }; int* alti; int n,cnt; queue q; void bfs(int alt, int cnt); int main() { int ans = -1; cin >> n; vector alti; for (int ..
