[백준] 1389 - 케빈 베이컨의 6단계 법칙(설명X)

123456789101112131415161718192021222324252627282930313233343536#include int main() { int N, M; scanf("%d %d", &N, &M); int** arr = new int* [N + 1]; for (int i = 1; i
algorithm'''problem solve 2020. 4. 30. 22:58
[백준] 1260 - DFS와 BFS(설명X)

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950#include #include #include using namespace std; void dfs(bool** arr, bool* visited, int size, int start) { printf("%d ", start); visited[start] = true; for (int i = 1; i 0) { int pos = order.front(); order.pop(); printf("%d ", pos); for (int i = 1; i
algorithm'''problem solve 2020. 4. 30. 19:01
[백준] 5525 - IOIOI(설명X)

12345678910111213141516171819202122232425#include #include using namespace std; int main() { int N, M, count = 0; string S; cin >> N >> M >> S; for (int j = 0; j
algorithm'''problem solve 2020. 4. 30. 18:14
[백준] 1780 - 종이의 개수(설명X)

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849#include using namespace std;int mm = 0, zero = 0, pp = 0; int papers(int** arr, int x, int y, int size) { int val = arr[x][y]; bool one = true; for (int i = 0; i
algorithm'''problem solve 2020. 4. 21. 10:45
[백준] 1541 - 잃어버린 괄호(설명X)

123456789101112131415161718192021222324252627282930313233#include using namespace std; int main() { char que[51]; scanf("%s", que); int num = 0, val = 0, minus = 0; for (int i = 0; i
algorithm'''problem solve 2020. 4. 20. 23:29
[백준] 11727 - 2xn 타일링 2(설명X)

12345678910111213141516171819#include using namespace std; int main() { int n; cin >> n; int** arr = new int* [3]; for (int i = 0; i
algorithm'''problem solve 2020. 4. 20. 18:59
[백준] 9375 - 패션왕 신해빈(설명X)

12345678910111213141516171819202122232425262728#include #include #include #include using namespace std; int main() { int T; scanf("%d", &T); for (int i = 0; i clothes >> category; if (_map.find(category) == _map.end()) _map[category] = 1; else _map[category]++; } for (map::iterator iter = _map.begin(); iter != _map.end(); iter++) { sets *= iter->second + 1; } printf("%d\n", sets - 1); }}Colored ..
algorithm'''problem solve 2020. 4. 20. 17:32
[백준] 7662 - 이중 우선순위 큐(설명X)

123456789101112131415161718192021222324252627282930313233#include #include #include using namespace std; int main() { int T; scanf("%d", &T); for (int i = 0; i
algorithm'''problem solve 2020. 4. 20. 02:29
[백준] 7576 - 토마토(설명X)

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253#include #include using namespace std; int main() { int M, N, max = 1, num = 0; scanf("%d %d", &M, &N); int** field = new int* [N]; queue bfs; for (int i = 0; i
algorithm'''problem solve 2020. 4. 19. 19:42
[백준] 1697 - 숨바꼭질(설명X)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 #include #include using namespace std; int main() { int N, K; cin >> N >> K; if (N>K) { cout
algorithm'''problem solve 2020. 4. 19. 02:04
1 ··· 4 5 6 7 8 9 10 ··· 19
공지사항
최근에 올라온 글
최근에 달린 댓글
Total
Today
Yesterday
링크
TAG more
«   2024/12   »
일 월 화 수 목 금 토
1 2 3 4 5 6 7
8 9 10 11 12 13 14
15 16 17 18 19 20 21
22 23 24 25 26 27 28
29 30 31
글 보관함