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 40 41 42 43 44 45 46 47 48 49 50 51 52 #include int main() { int input; scanf("%d", &input); int* arr = new int[8001]{ 0, }; for (size_t i = 0; i 0 ? (double)sum / input + 0.5 : (double)sum / input - 0.5; printf("%d\n%d\n", (int)sum_avg, mid); int tmp1 = -4001, tmp2 = 0; for (int i = 8000;..
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 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 #include void mergeSort(int n, int* array); void merge(int h, int m, int* U, int* V, int* S); int main() { int input; scanf("%d", &input); int* number = new int[input]; for (int i = 0; i
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 40 41 42 43 44 45 46 47 48 //#define _CRT_SECURE_NO_WARNINGS //#include #include //using namespace std; void quickSort(int low, int high, int* array); int partition(int low, int high, int* array); int main() { int input; scanf("%d", &input); int* number = new int[input]; for (int i = 0; i
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 #include using namespace std; int main() { int N, M; cin >> N >> M; char** ary = new char* [N]; for (int i = 0; i > ary[i]; } int tmp, min = N * M; for (int i = 0; i
123456789101112131415161718192021222324252627282930313233343536373839#include using namespace std; class Person {private: int height, weight, rank;public: Person() { this->height = 0; this->weight = 0; this->rank = 1; } void setInfo(int weight, int height) { this->weight = weight; this->height = height; } static void compare(Person &person1, Person &person2) { if (person1.weight > person2.weight..
12345678910111213141516171819202122232425262728#include #include using namespace std; int main() { int input; cin >> input; for (int i = 0; i > x1 >> y1 >> r1 >> x2 >> y2 >> r2; double length = sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)); if (x1 == x2 && y1 == y2) { if (r1 == r2) cout
- Total
- Today
- Yesterday
- PyPy3
- LG
- 구현
- 피보나치
- BaekJoon
- c
- 컨트리뷰톤
- 백트래킹
- 브루트포스
- 카카오
- 1932
- 이분탐색
- 알고리즘
- 오픈소스
- 완전탐색
- 코딩
- DP
- 인공지능
- 플로이드 와셜
- c++
- 파이썬
- 프로그래머스
- 백준
- 동적 계획법
- 한화큐셀
- DFS
- 정렬
- Dynamic Programming
- webOS
- BFS
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |