[그리디] 3월 26일

06_그리디/라이브코딩/11047.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main() {
+	ios::sync_with_stdio(false);
+	cin.tie(NULL); cout.tie(NULL);
+
+	int n, k, cnt = 0;
+	vector<int>value;
+	cin >> n >> k;
+
+	value.assign(n, 0);
+	for (int i = 0; i < n; i++) {
+		cin >> value[i];
+	}
+
+	while (n--) {
+		cnt += k / value[n];  // n-1 -> n-2 -> ... -> 0
+		k %= value[n];  //나머지 계산 가능
+	}
+
+	cout << cnt;
+
+	//int n = 3;
+	//while (n--) {
+	//	cout << n << "\n";
+	//}
+	//2 -> 1 -> 0 출력
+
+	//int n = 3;
+	//while (--n) {
+	//	cout << n << "\n";
+	//}
+	//2 -> 1 출력
+
+	return 0;
+}

06_그리디/라이브코딩/1931.cpp

@@ -0,0 +1,38 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+typedef pair<int, int> meet;
+
+int main() {
+	ios::sync_with_stdio(false);
+	cin.tie(NULL); cout.tie(NULL);
+
+	int n, cnt = 0;
+	int end;
+	vector<meet>v;
+	cin >> n;
+	v.assign(n, { 0,0 });
+
+	for (int i = 0; i < n; i++) {
+		cin >> v[i].second >> v[i].first;  // first에 끝나는 시간 넣어야 정렬!
+	}
+
+	sort(v.begin(), v.end()); // 정렬해야 가장 빨리 끝나는 회의 찾을 수 있음!
+	end = 0;
+
+	for (int i = 0; i < n; i++) {
+		if (end > v[i].second) {
+			continue;
+		}
+		cnt++;
+		end = v[i].first;
+	}
+
+	cout << cnt;
+
+
+	return 0;
+}

06_그리디/라이브코딩/체육복.cpp

@@ -0,0 +1,41 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int solution (int n, vector<int> lost, vector<int> reserve){
+    int answer = 0;
+    vector<int> clothes_cnt (n+1, 1); //옷의 개수를 저장하는 벡터. 초기 설정값 1.
+
+    //잃어버린 인덱스 -> --
+    for (int i = 0; i < lost.size(); i++) {
+        clothes_cnt[lost[i]]--;    
+    }    
+    //여벌 인덱스 -> ++
+    for (int i = 0; i < reserve.size(); i++) {
+        clothes_cnt[reserve[i]]++;
+    }
+
+    for (int i=0; i<= n; i++){
+        if (clothes_cnt[i] >=1){
+            continue;
+        }
+
+        if (clothes_cnt[i-1]==2){
+            clothes_cnt[i-1]--;
+            clothes_cnt[i]++;
+        }
+        else if (clothes_cnt[i+1]==2){
+            clothes_cnt[i+1]--;
+            clothes_cnt[i]++;
+        }
+    }
+
+    for (int i=1; i<= n; i++){
+        if (clothes_cnt[i] >= 1){
+            answer++;
+        }
+    }
+
+    return answer;
+}

06_그리디/필수/1213.cpp

@@ -0,0 +1,62 @@
+#include <iostream>
+#include <vector>
+#include <string>
+
+using namespace std;
+
+const int ALPHA_NUM = 26;
+
+string makePalindrome(string name, vector<int>& cnt) {
+	string ans = "";
+	char center_alpha;
+	int center_cnt = 0;
+
+	for (char c : name) {
+		cnt[c - 'A']++;
+	}
+
+	for (int i = 0; i < ALPHA_NUM; i++) {
+		// 써줘야 없는 글자 출력 안됨! 
+		// 0도 2로 나누면 나머지 0이라 이 조건문 없으면 출력되기 때문!
+		if (cnt[i] == 0) {
+			continue; 
+		}
+
+		if (cnt[i] % 2 != 0) {
+			center_alpha = i+'A';
+			center_cnt++;
+			if (center_cnt == 2) {
+				return  "I'm Sorry Hansoo";
+			}
+		}
+
+		int n = cnt[i]/2;
+		while (n--) {
+			ans += i + 'A';
+		}
+
+	}
+
+	if (center_cnt == 1) {
+		ans += center_alpha;
+	}
+	for (int i = name.size()/2 - 1; i >= 0; i--) {
+		//이렇게 해야 name의 길이가 짝수든 홀수든 알맞게 거꾸로 출력됨
+		ans += ans[i];
+	}
+
+	return ans;
+}
+
+int main() {
+	ios::sync_with_stdio(false);
+	cin.tie(NULL); cout.tie(NULL);
+
+	string name;
+	vector<int>cnt(ALPHA_NUM, 0);
+	cin >> name;
+
+	cout << makePalindrome(name, cnt);
+
+	return 0;
+}

06_그리디/필수/15662.cpp

@@ -0,0 +1,60 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+const int SAW_NUM = 8;
+
+void rotateWheel(pair<int, int>& rotate, vector<vector<int>>& v) {
+	int num = rotate.first;
+	int dir = rotate.second;
+	//if (num != 4) {
+	//	if (v[num][3] != v[num+1][7]) {
+	//		
+	//	}
+	//	
+	//}
+
+	return;
+}
+
+int printAnswer(vector<vector<int>>& v, int t) {
+	int cnt = 0;
+
+	for (int i = 1; i <= t; i++) {
+		if (v[i][1] == 1) {
+			cnt++;
+		}
+	}
+
+	return cnt;
+}
+
+int main() {
+	ios::sync_with_stdio(false);
+	cin.tie(NULL); cout.tie(NULL);
+
+	int t, k;
+	vector<vector<int>> v;
+	pair<int, int>rotate;
+	cin >> t;
+
+	v.assign(t + 1, vector<int>(SAW_NUM + 1));
+
+
+	for (int i = 1; i <= t; i++) {
+		for (int j = 1; j <= SAW_NUM; j++) {
+			cin >> v[i][j];
+		}
+	}
+
+	cin >> k;
+	while (k--) {
+		cin >> rotate.first >> rotate.second;
+		rotateWheel(rotate, v);
+	}
+
+	cout << printAnswer(v, t);
+
+	return 0;
+}

06_그리디/필수/17451.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+long long findSpeed(vector<long long>& d) {
+	long long min = 0;
+	for (long long i : d) {
+		if (i > min) {
+			min = i;
+		}
+		else {
+			min = ((min-1) / i + 1) * i;
+			// min-1 안해주면 틀림! 
+			// 그냥 min 하면 같은 속도 연속으로 주어졌을 때 오류
+		}
+	}
+
+	return min;
+}
+
+int main() {
+	ios::sync_with_stdio(false);
+	cin.tie(NULL); cout.tie(NULL);
+
+	int n;
+	vector<long long>d;
+	cin >> n;
+
+	d.assign(n, 0);
+
+	for (int i = n-1; i >= 0; i--) {
+		cin >> d[i];
+	}
+
+	cout << findSpeed(d);
+
+	return 0;
+}