하루 코딩 하루 코딩

Algorithm/BOJ

• 배수 공사

  Algorithm/BOJ 2020. 3. 7. 05: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 //15817 - 배수공사 #include using namespace std; int N, K; int arr[100]; int arr2[100]; int cache[100][10001]; void init() { cin >> N >> K; for(int i = 0; i> arr[i] >> arr2[i]; for(int i = 0; i

  Read More

• 천재 수학자 성필 - 15815

  Algorithm/BOJ 2020. 3. 7. 05:22

  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 //15815 - 천재 수학자 성필 #include #include using namespace std; int main() { string s; cin >> s; stack St; int size = s.size(); char c; int num, num2; for(int i = 0; i

  Read More

• 야뱌위 대장 - 15814

  Algorithm/BOJ 2020. 3. 7. 05:20

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 //15814 - 야바위 대장 #include using namespace std; string s; int main() { cin >> s; int N; cin >> N; int x, y; char c; for(int i = 0; i> x >> y; c = s[x]; s[x] = s[y]; s[y] = c; } cout

  Read More

• 너의 이름은 몇 점이니? - 15813

  Algorithm/BOJ 2020. 3. 7. 05:19

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 //15813 - 너의 이름은 몇 점이니? #include using namespace std; int N; string s; int main() { cin >> N; cin >> s; int ans = 0; for(int i = 0; i

  Read More

• 침략자 진아 - 15812

  Algorithm/BOJ 2020. 3. 7. 05:16

  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 //15812 - 침략자 진아 #include #include #include using namespace std; int N, M; int V, E; int xnum = 0; int arr[20][20]; int isVil[400]; int xarr[4] = {0,0,1,-1}; ..

  Read More

• 복면산?! - 15811

  Algorithm/BOJ 2020. 3. 7. 05:14

  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 //15811 - 복면산?! #include #include #include #include using namespace std; string s1, s2, s3; map M; vector exist; string..

  Read More

• 풍선 공장 - 15810

  Algorithm/BOJ 2020. 3. 7. 05:11

  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 //15810 - 풍선 공장 #include #include #include using namespace std; int N, M; priority_queue pq; vector v; void init() { cin >> N >> M; pq = priority_queue(); v = vector(N); int x; for(int i = 0; i> x; pq.push(make_pair(-x, i)); v[i] = x; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); init(); lon..

  Read More