Merge pull request #64 from ottffss1005/main

pull request

Author: ottffss1005

Soyoung/week7/BOJ_13023

@@ -0,0 +1,30 @@
+package Study;
+import java.util.*;
+import java.io.*;
+
+public class BOJ_13023 {
+
+    static ArrayList[] graph;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        //알고리즘 캠프 사람 수
+        int N = Integer.parseInt(st.nextToken());
+        //관계 수
+        int M = Integer.parseInt(st.nextToken());
+
+        graph = new ArrayList[N+1];
+        boolean[] visited = new boolean[N];
+
+        boolean dfs(int node, int depth){
+
+        }
+
+
+        for(int i=0;i<M;i++){
+
+        }
+    }
+}

Soyoung/week8/BOJ_1260.java

@@ -0,0 +1,73 @@
+import java.util.*;
+import java.io.*;
+
+public class Main {
+    static ArrayList<Integer>[] graph;
+    static boolean[] visited;
+    static StringBuilder sb = new StringBuilder();
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int N = Integer.parseInt(st.nextToken());
+        int M = Integer.parseInt(st.nextToken());
+        int V = Integer.parseInt(st.nextToken());
+
+        graph = new ArrayList[N + 1];
+        for (int i = 1; i <= N; i++) {
+            graph[i] = new ArrayList<>();
+        }
+
+        for (int i = 0; i < M; i++) {
+            st = new StringTokenizer(br.readLine());
+            int a = Integer.parseInt(st.nextToken());
+            int b = Integer.parseInt(st.nextToken());
+            graph[a].add(b);
+            graph[b].add(a);
+        }
+
+        //정렬
+        for (int i = 1; i <= N; i++) {
+            Collections.sort(graph[i]);
+        }
+
+        visited = new boolean[N + 1];
+        dfs(V);
+        sb.append("\n");
+
+        visited = new boolean[N + 1];
+        bfs(V);
+
+        System.out.println(sb);
+    }
+
+    //DFS
+    static void dfs(int v) {
+        visited[v] = true;
+        sb.append(v).append(" ");
+        for (int next : graph[v]) {
+            if (!visited[next]) {
+                dfs(next);
+            }
+        }
+    }
+
+    //BFS
+    static void bfs(int start) {
+        Queue<Integer> q = new LinkedList<>();
+        q.add(start);
+        visited[start] = true;
+
+        while (!q.isEmpty()) {
+            int v = q.poll();
+            sb.append(v).append(" ");
+            for (int next : graph[v]) {
+                if (!visited[next]) {
+                    visited[next] = true;
+                    q.add(next);
+                }
+            }
+        }
+    }
+}

Soyoung/week9/BOJ_11047.java

@@ -0,0 +1,31 @@
+import java.util.*;
+import java.io.*;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int N = Integer.parseInt(st.nextToken());
+        int M = Integer.parseInt(st.nextToken());
+
+        int [] arr = new int [N];
+        for (int i = 0; i < N; i++) {
+            arr[i] = Integer.parseInt(br.readLine());
+        }
+
+        int count = 0;
+        for (int i = N - 1; i >= 0; i--) {
+            if (arr[i] <= M) {
+                count += M / arr[i];
+                M = M % arr[i];
+            }
+        }
+
+        bw.write(count); 
+        bw.flush();
+        br.close();
+        bw.close();
+    }
+}

Soyoung/week9/BOJ_1920.java

@@ -0,0 +1,35 @@
+import java.util.*;
+import java.io.*;
+
+public class BOJ_1920 {
+    public static void main (String [] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+
+        int N = Integer.parseInt(br.readLine());
+        int [] arr = new int [N];
+
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        for(int i = 0; i < N; i++) {
+            arr[i] = Integer.parseInt(st.nextToken());
+        }
+
+        Arrays.sort(arr);
+
+        int M = Integer.parseInt(br.readLine());
+        st = new StringTokenizer(br.readLine());
+        for(int i = 0; i < M; i++) {
+            int key = Integer.parseInt(st.nextToken());
+
+            if(Arrays.binarySearch(arr, key) >= 0) {
+                bw.write("1\n");
+            } else {
+                bw.write("0\n");
+            }
+        }
+
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+}

Soyoung/week9/BOJ_2343.java

@@ -0,0 +1,58 @@
+import java.util.*;
+import java.io.*;
+
+public class Main{
+
+    public static void main(String[] args) throws IOException{
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+
+        //한 줄에서 같이 읽어야 함
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int N = Integer.parseInt(st.nextToken());
+        int M = Integer.parseInt(st.nextToken());
+
+        
+        st = new StringTokenizer(br.readLine());
+        int [] arr = new int [N];
+        int max = 0;
+        int sum = 0;
+
+        for(int i=0; i<N; i++){
+            arr[i] = Integer.parseInt(st.nextToken());
+            max = Math.max(max, arr[i]);
+            sum += arr[i];
+        }
+
+        int left = max;  // 최소 블루레이 크기
+        int right = sum; // 최대 
+        int answer = sum;
+
+        while (left <= right) {
+            int mid = (left + right) / 2;
+
+            int count = 1;
+            int current = 0;
+
+            for (int time : arr) {
+                if (current + time > mid) {
+                    count++;
+                    current = 0;
+                }
+                current += time;
+            }
+
+            if (count > M) {
+                left = mid + 1;
+            } else {
+                answer = mid;
+                right = mid - 1;
+            }
+        }
+
+        bw.write(answer + "\n");
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+}