[백준] 1676 - 팩토리얼 0의 개수

1234567891011121314151617181920212223#include int main() { int N, two = 0, five = 0; scanf("%d", &N); for (int i = 2; i five ? five : two);}Colored by Color Scriptercs
algorithm'''problem solve 2020. 4. 18. 01:28
[백준] 11279 - 최대 힙(설명X)

12345678910111213141516171819202122232425262728293031#include #include #include using namespace std; int main() { priority_queue p_queue; int N; scanf("%d", &N); for (int i = 0; i
algorithm'''problem solve 2020. 4. 17. 22:33
[백준]11723 - 집합(설명X)

12345678910111213141516171819202122232425262728293031323334353637383940414243444546#include #include int main() { bool arr[21]{ true, }; int M; scanf("%d", &M); for (int i = 0; i
algorithm'''problem solve 2020. 4. 10. 00:06
[백준]2606 - 바이러스(설명X)

1234567891011121314151617181920212223242526272829303132#include using namespace std; void DFS(bool** connect, bool* arr, int size, int pos, int inf = 0) { for (int i = 1; i > T >> num; bool* arr = new bool[T + 1]{ false, }; bool** connect = new bool* [T + 1]; for (int i = 1; i com1 >> com2; connect[com1][com2] = true; connect[com2][com1] = true; } DFS(connect, arr, T, 1); for (int i = 1; i
algorithm'''problem solve 2020. 4. 9. 18:11
[백준] 1931 - 회의실배정(설명X)

1234567891011121314151617181920212223242526272829303132333435363738394041#include #include using namespace std; class Meeting {private: int start, end;public: bool operatorend == m1.end) return this->start end start = start; this->end = end; } int getEnd() { return end; } int getStart() { return start; }}; int main() { int N, cnt = 0, criterion = 0; cin >> N; Meeting* meetings = new Meeting[N]; ..
algorithm'''problem solve 2020. 4. 9. 16:16
[백준] 11726 - 2xn타일링(설명X)

1234567891011121314151617#include using namespace std; int main() { int n; cin >> n; int** arr = new int*[n + 1]; for (int i = 1; i
algorithm'''problem solve 2020. 4. 9. 11:43
[백준]11724 - 연결 요소의 개수

123456789101112131415161718192021222324252627282930313233#include using namespace std; void find(int** grp, int* arr, int size, int val) { arr[val] = 1; for (int pos = 0; pos > N >> M; int* arr = new int[N + 1]{ 0, }; int** grp = new int*[N + 1]; for (int i = 1; i u >> v; grp[u][v] = 1; grp[v][u] = 1; } for (int i = 1; i
algorithm'''problem solve 2020. 4. 9. 01:24
[백준]11399 - ATM(설명X)

123456789101112131415161718#include #include using namespace std; int main() { int N; cin >> N; int* arr = new int[N]; for (int i = 0; i > arr[i]; sort(arr, arr + N); int time = 0; for (int i = 0; i
algorithm'''problem solve 2020. 4. 8. 23:04
[백준]9095 - 1, 2, 3 더하기(설명X)

1234567891011121314151617181920#include using namespace std; int main() { int T, n; cin >> T; int arr[11][3] = { 0, }; arr[1][0] = 1; for (int i = 1; i n; cout
algorithm'''problem solve 2020. 4. 8. 22:56
[백준]2630 - 색종이 만들기(설명X)

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748#include bool isFilled(int** arr, int x, int y, int size, int color) { for (int i = 0; i
algorithm'''problem solve 2020. 4. 8. 18:28
1 ··· 5 6 7 8 9 10 11 ··· 15
공지사항
최근에 올라온 글
최근에 달린 댓글
Total
Today
Yesterday
링크
TAG more
«   2025/01   »
일 월 화 수 목 금 토
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
글 보관함