[2021-08-14] 21주차 마무리

Jeongyo-Han/baekjoon/1085.cc

@@ -0,0 +1,19 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+#include <vector>
+
+using namespace std;
+int main()
+{
+  ios::sync_with_stdio(false);
+  cin.tie(NULL);
+  cout.tie(NULL);
+
+  int x, y, h, w;
+  cin >> x >> y >> w >> h;
+
+  int a = min(w-x, h-y);
+  int b = min(x-0, y-0);
+  cout << min(a, b);
+}

Jeongyo-Han/baekjoon/2437.cc

@@ -0,0 +1,29 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+#include <vector>
+
+using namespace std;
+int main()
+{
+  ios::sync_with_stdio(false);
+  cin.tie(NULL);
+  cout.tie(NULL);
+
+  int n;
+  cin >> n;
+  vector<int> arr(n);
+
+  for (int i=0;i<n;i++) {
+    cin >> arr[i];
+  }
+  sort(arr.begin(), arr.end());
+
+  int sum=0;
+  for (int i=0;i<n; i++){
+    if (sum+1 < arr[i]) break;
+    sum += arr[i];
+  }
+
+  cout << sum+1;
+}

Seah-An/inflearn/implementation/Answer.java

@@ -0,0 +1,27 @@
+package section.string.num3;
+
+import java.util.Scanner;
+
+public class Answer {
+    public String solution(String str) {
+        String answer = "";
+
+        // 가장 작은 수로 초기화됨
+        int m = Integer.MIN_VALUE;
+        String[] s = str.split(" ");
+        for (String x : s) {
+            int len = x.length();
+            if (len > m) {
+                m = len;
+            }
+        }
+        return answer;
+    }
+
+    public static void main(String[] args) {
+        Answer a = new Answer();
+        Scanner kb = new Scanner(System.in);
+        String str = kb.nextLine();
+        System.out.println(a.solution(str));
+    }
+}

Seah-An/inflearn/implementation/AnswerFor1.java

@@ -0,0 +1,39 @@
+package section.string.num1;
+
+import java.util.Scanner;
+
+public class AnswerFor1 {
+    public int solution(String str, char t){
+        int answer = 0;
+        str = str.toUpperCase();
+        t = Character.toUpperCase(t);
+
+        // 2번 방법
+        // .toCharArray()로 새로운 문자배열을 할당해줄 수 있음
+        for(char x : str.toCharArray()){
+            if(x==t) answer ++;
+        }
+
+        // charAt()은 char형을 리턴해준다.
+        // 1번 방법
+        /*
+        for(int i=0;i<str.length();i++){
+            if(str.charAt(i) == t){
+                answer ++;
+            }
+        }
+          */
+        return answer;
+    }
+
+    public static void main(String[] args){
+        AnswerFor1 T = new AnswerFor1();
+        Scanner kb = new Scanner(System.in);
+        String str = kb.next();
+        char c = kb.next().charAt(0);
+
+
+        System.out.print(T.solution(str,c));
+    }
+
+}

Seah-An/inflearn/implementation/AnswerFor2.java

@@ -0,0 +1,24 @@
+package section.string.num2;
+
+import java.util.Scanner;
+
+public class AnswerFor2 {
+    public String solution(String str){
+        String answer ="";
+
+        for(char x: str.toCharArray()){
+            if(Character.isLowerCase(x)) answer += Character.toUpperCase(x);
+            else answer += Character.toLowerCase(x);
+        }
+        return answer;
+    }
+
+    public static void main(String[] args) {
+        AnswerFor2 T = new AnswerFor2();
+
+        Scanner kb = new Scanner(System.in);
+
+        String str = kb.next();
+        System.out.println(T.solution(str));
+    }
+}

Seah-An/inflearn/search/랜선자르기80.py

@@ -0,0 +1,25 @@
+import sys
+
+# sys.stdin = open('input.txt', 'r')
+
+K, N = map(int, input().split())
+
+'''
+1. 잘린 랜선의 최소 길이 = 다 더한뒤 11로 나누기
+2. while 문을 돌면서 각각의 랜선을 잘린 랜선의 최대길이로 나누기
+3. 자른 길이를 더하는데, 모두 더한값이 11보다 작을 경우 랜선의 최대 길이 -1
+4. 만약 자른 길이의 갯수 >= 11이라면 print(자른 길이의 갯수) 하고 break
+'''
+lan_lines = [int(input()) for i in range(K)]
+
+max_length = sum(lan_lines) // N
+
+while True:
+    count = 0
+    for i in range(K):
+        count += lan_lines[i] // max_length
+    if count >= N:
+        print(max_length)
+        break
+    else:
+        max_length -= 1

Seah-An/inflearn/search/마구간 정하기.py

@@ -0,0 +1,38 @@
+import sys
+
+sys.stdin = open('input.txt', 'r')
+
+N, C = map(int, input().split())
+
+# 가장 가까운 두 말의 최대 거리
+
+x_lists = []
+for i in range(N):
+    x_lists.append(int(input()))
+# 1 2 4 8 9
+
+# 1 3 5 6 7 8 9 10
+x_lists.sort()
+
+lt = x_lists[0]
+rt = x_lists[-1]
+mid = 0
+while lt <= rt:
+    mid = (lt + rt) // 2
+    stack = []
+    stack.append(x_lists[0])
+    count = 0
+    for i in range(1, N):
+        if count == C:
+            lt = mid + 1
+            stack = []
+            break
+        elif x_lists[i] - stack[0] >= mid:
+            stack.append(x_lists[i])
+            print(stack.pop(0))
+    else:
+        if count < C:
+            rt = mid -1
+            stack = []
+            break
+print(mid)

Seah-An/inflearn/search/이분검색.py

@@ -0,0 +1,21 @@
+import sys
+
+sys.stdin = open('input.txt', 'r')
+
+N, M = map(int, input().split())
+lists = list(map(int, input().split()))
+
+lists.sort()
+
+lt = 0
+rt = N - 1
+
+while lt <= rt:
+    mid = (lt + rt) // 2
+    if lists[mid] == M:
+        print(mid + 1)
+        break
+    elif lists[mid] > M:
+        rt = mid - 1
+    elif lists[mid] < M:
+        lt = mid + 1