하루 코딩 하루 코딩

Algorithm/BOJ

• 369 - 17614

  Algorithm/BOJ 2020. 7. 19. 18:17

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 //17614 - 369 #include using namespace std; int N; int main() { cin >> N; int ans = 0; int num; int last; for(int i = 1; i

  Read More

• 비트베리 - 17374

  Algorithm/BOJ 2020. 7. 13. 15:44

  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 //17374 - 비트베리 #include using namespace std; int tnum, P, Q, A, B, C, D; int ans; void init() { cin >> P >> Q >> A >> B >> C >> D; } int PtoCn() { int ret = P/(A+B); ret = max(B*ret, P-A*(ret+1)); return ret; } int CntoP(int cn) { int ret = cn/(A+B); ret = max(A*ret, cn-B*(ret+..

  Read More

• 사탕 줍는 로봇 - 15892

  Algorithm/BOJ 2020. 7. 6. 15:53

  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 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 //15892 - 사탕 줍는 로봇 #include #include #include using namespace std; int N, M; typedef struct edge { int..

  Read More

• 세 용액 - 2473

  Algorithm/BOJ 2020. 4. 16. 13:08

  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 60 61 62 63 64 65 66 67 68 69 70 71 //2473 - 세 용액 #include #include using namespace std; int N; long long ans; long long arr[5000]; long long target; int idx1, idx2, idx3; void init() { ans = 3000000000; cin >> N; for (int i = 0; ..

  Read More

• 소가 길을 건너간 이유 6 - 14466

  Algorithm/BOJ 2020. 4. 1. 16:59

  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 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 //14466 - 소가 길을 건너간 이유 6 #include #include using namespace std; int N, K, R; int arr[100][100]; vector adj; bool isCow[10000]..

  Read More

• 네트워크 연결 - 3780

  Algorithm/BOJ 2020. 4. 1. 14:19

  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 60 61 62 63 64 65 66 67 68 69 //3780 - 네트워크 연결 #include #include using namespace std; int N; int Dist(int u, int v) { int ret = (u - v > 0 ? u - v : v - u); return ret % 1000; } struct DisjointSet { vector parent, dist; DisjointSe..

  Read More

• 정점들의 거리 - 1761

  Algorithm/BOJ 2020. 3. 30. 13:46

  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 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 //1761 - 정점들의 거리 #include #include using namespace std; int N, M; vector adj; int parent[40001][17..

  Read More