1주차 알고리즘 스터디 문제풀이 코드 - 김선호

20210818/BOJ13567.java

@@ -0,0 +1,61 @@
+package day1.robot;
+// https://www.acmicpc.net/problem/13567
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.StringTokenizer;
+
+public class BOJ13567 {
+    static int M, N;
+    static int dx[] = { 1, 0, -1, 0 }; // 동남서북
+    static int dy[] = { 0, -1, 0, 1 };
+
+
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        M = Integer.parseInt(st.nextToken());
+        N = Integer.parseInt(st.nextToken());
+
+        String action;
+        int num;
+        int x=0; int y=0;
+        int dir =0;
+
+        for(int i=0; i< N; i++) {
+            StringTokenizer st2 = new StringTokenizer(br.readLine());
+
+            action = st2.nextToken();
+            num = Integer.parseInt(st2.nextToken());
+
+
+            if(action.equals("MOVE")) {
+                x += dx[dir]*num;
+                y += dy[dir]*num;
+                if(ifOut(x,y,M)){
+                    System.out.println(-1);
+                    return;
+                }
+            }
+            else if(action.equals("TURN")) {
+                if(num==0){
+                    dir = (dir + 4-1)%4;
+                }
+                else{
+                    dir = (dir+1)%4;
+                }
+            }
+
+
+        }
+
+        System.out.println(x+" "+y);
+
+    }
+
+    public static boolean ifOut(int x, int y, int m) {
+        return x>=m || y>=m || x<0 || y<0;
+    }
+}

20210818/BOJ14467.java

@@ -0,0 +1,29 @@
+package day1;
+// https://www.acmicpc.net/problem/14467
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class BOJ14467 {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int ansewer =0;
+        int all = sc.nextInt();
+        int[] cow = new int[11];
+        Arrays.fill(cow,-1);
+        int key; int cross;
+
+        for(int i=0;i<all;i++) {
+            key = sc.nextInt();
+            cross = sc.nextInt();
+
+            if(cow[key]==-1) cow[key] = cross;
+            else if(cow[key] != cross){
+                ansewer += 1;
+                cow[key] = cross;
+            }
+        }
+        System.out.println(ansewer);
+
+
+    }
+}

20210818/BOJ2870.java

@@ -0,0 +1,32 @@
+package bjon2870;
+//https://par3k.tistory.com/86
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.math.BigInteger;
+import java.util.ArrayList;
+import java.util.Collections;
+
+public class BOJ2870 {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        int N = Integer.parseInt(br.readLine());
+        ArrayList<BigInteger> answer = new ArrayList<>();
+        String[] line;
+
+        for(int i=0;i<N;i++) {
+            line = br.readLine().split("\\D");
+            for(int j=0;j<line.length;j++) {
+                if(!line[j].equals("")) answer.add(new BigInteger(line[j]));
+            }
+        }
+        Collections.sort(answer);
+
+        for(int i=0;i<answer.size();i++) {
+            System.out.println(answer.get(i));
+        }
+
+    }
+}

20210818/BOJ3048.java

@@ -0,0 +1,68 @@
+package day1.ant;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.StringTokenizer;
+
+public class BOJ3048 {
+    public static void main(String[] args) throws IOException {
+
+        System.out.println("입력 : ");
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        int a1 = Integer.parseInt(st.nextToken());
+        int a2 = Integer.parseInt(st.nextToken());
+
+        char[] ant1 = new char[a1];
+        char[] ant2;
+
+        String str = br.readLine();
+
+        for(int i=0;i<a1;i++) {
+            ant1[i] = str.charAt(a1-1- i);
+        }
+
+        ant2 = br.readLine().toCharArray();
+
+        char[] all_ant = new char[a1 + a2];
+        int[] idx = new int[a1 + a2];
+
+        for(int i=0; i<all_ant.length;i++) {
+            if(i<a1) {
+                all_ant[i] = ant1[i];
+                idx[i] = 0;
+            }
+            else {
+                all_ant[i] = ant2[i - a1];
+                idx[i] = 1;
+            }
+        }
+
+        int cnt = Integer.parseInt(br.readLine());
+        char tmp;
+        int idx_tmp;
+
+        while(cnt>0){
+            cnt--;
+            for(int i=0;i<all_ant.length-1;i++){
+                if(idx[i]==0&&idx[i+1]==1) {
+                    tmp = all_ant[i];
+                    all_ant[i] = all_ant[i + 1];
+                    all_ant[i + 1] = tmp;
+                    idx_tmp = idx[i];
+                    idx[i] = idx[i + 1];
+                    idx[i+1] = idx_tmp;
+                    i++;
+                }
+            }
+
+        }
+
+        for (char c : all_ant) {
+            System.out.print(c);
+        }
+
+    }
+}

20210818/BOJ4659.java

@@ -0,0 +1,77 @@
+package bjon4659;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+
+public class BOJ4659 {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        String tmp;
+
+        while(!(tmp=br.readLine()).equals(("end"))){
+
+            if(total(tmp))
+                System.out.println("<"+tmp+">"+" is acceptable.");
+            else
+                System.out.println("<"+tmp+">"+" is not acceptable.");
+
+
+        }
+    }
+    static boolean total(String tmp){
+        if(rule_vowel(tmp)){
+            if(rule_chain(tmp)){
+                if(rule_same(tmp))
+                    return true;
+            }
+        }
+        return false;
+    }
+
+    static boolean rule_vowel_ch(char ch) {
+        if(ch=='a'|| ch=='e' || ch=='i' || ch=='o' || ch=='u')
+            return true;
+        return false;
+    }
+
+
+    static boolean rule_vowel(String tmp) {
+
+        for(int i=0;i<tmp.length();i++) {
+            if(rule_vowel_ch(tmp.charAt(i)))
+                return true;
+        }
+        return false;
+    }
+
+    static boolean rule_chain(String tmp) {
+        int mcnt =0; int jcnt=0;
+        for(int i=0;i<tmp.length();i++) {
+            if(rule_vowel_ch(tmp.charAt(i))) {
+                mcnt++;
+                jcnt = 0;
+            }
+            else {
+                jcnt++;
+                mcnt = 0;
+            }
+            if(mcnt==3 || jcnt==3)
+                return false;
+        }
+        return true;
+
+    }
+
+    static boolean rule_same(String tmp) {
+        if(tmp.length()>1){
+            for(int i=0; i<tmp.length()-1;i++){
+                if(tmp.charAt(i)==tmp.charAt(i+1)){
+                    if(tmp.charAt(i)!='e'&& tmp.charAt(i)!='o')
+                        return false;
+                }
+            }
+        }
+        return true;
+    }
+}

20210818/BOJ5635.java

@@ -0,0 +1,44 @@
+package day1.birthday;
+
+
+import java.io.IOException;
+import java.util.Scanner;
+
+
+class BOJ5635 {
+    public static void main(String[] args) throws IOException {
+
+
+        Scanner scan = new Scanner(System.in);
+
+        int nums = Integer.parseInt(scan.nextLine());
+
+        int max = Integer.MAX_VALUE;
+        int min = Integer.MIN_VALUE;
+
+        String minNA = "";
+        String maxNA = "";
+
+        for(int i=0;i<nums;i++) {
+            String exNa = scan.next();
+            int day = 0;
+            day += Integer.parseInt(scan.next());
+            day += Integer.parseInt(scan.next())* 100;
+            day += Integer.parseInt(scan.next()) * 10000;
+
+
+            if(min<day) {
+                min = day;
+                minNA = exNa;
+            }
+            else if (max>day) {
+                max = day;
+                maxNA = exNa;
+            }
+        }
+
+        System.out.println(minNA);
+        System.out.println(maxNA);
+
+        }
+}

20210818/BOJ7785.java

@@ -0,0 +1,38 @@
+package bjon7785;
+// https://www.acmicpc.net/problem/7785
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+
+public class BOJ7785 {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int num = Integer.parseInt(br.readLine());
+        StringTokenizer st;
+        ArrayList<String> answer = new ArrayList<>();
+
+        Map<String, String> map = new HashMap<>();
+
+
+
+        for(int i=0; i<num; i++) {
+            st = new StringTokenizer(br.readLine());
+            String name = st.nextToken();
+            String state = st.nextToken();
+
+            map.put(name, state);
+        }
+
+        for(String key : map.keySet()) {
+            if(map.get(key).equals("enter")) answer.add(key);
+        }
+        Collections.sort(answer, Collections.reverseOrder());
+
+        for(int i=0; i<answer.size();i++) {
+            System.out.println(answer.get(i));
+        }
+
+    }
+}

20210818/Weekly_2th.java

@@ -0,0 +1,6 @@
+package day1.weekly2;
+
+public class Weekly_2th {
+    // https://programmers.co.kr/learn/courses/30/lessons/83201?language=java
+
+}