백준 그리디 + 프로그래머스 양궁 , 문자열

Basic_Of_Algorithm/src/Today_22_05_24/backJoon_greedy_no1.java

@@ -0,0 +1,65 @@
+package Today_22_05_24;
+
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class backJoon_greedy_no1 {
+
+	static int answer = -1;
+
+	public static void main(String[] args) throws Exception {
+
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+		String n = br.readLine();
+
+
+
+		String str = String.valueOf(n);
+
+		boolean[]visited = new boolean[str.length()];
+
+
+		dfs(visited,str,"",0);
+
+		System.out.println(String.valueOf(answer));
+
+	}
+
+	static boolean check(String now) {
+
+		int a = Integer.parseInt(now);
+
+		if(a%30==0) return true;
+		else return false;
+
+
+
+	}
+
+	static void dfs(boolean[]visited,String str,String now,int count) {
+
+
+		if(count==str.length()) {
+			if(check(now)) {
+				answer = Math.max(answer, Integer.parseInt(now));
+			}
+			return;
+		}
+
+			for(int i=0;i<str.length();i++) {
+				if(!visited[i]) {
+					visited[i] = true;
+					String next = now + str.charAt(i);
+					dfs(visited,str,next,count+1);
+					visited[i] = false;
+				}
+			}
+
+	}
+
+
+
+
+}

Basic_Of_Algorithm/src/Today_22_05_24/backJoon_greedy_no2.java

@@ -0,0 +1,59 @@
+package Today_22_05_24;
+
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class backJoon_greedy_no2 {
+
+
+
+	public static void main(String[] args) throws Exception {
+
+	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+	int t = Integer.parseInt(br.readLine());
+
+	//25 10 5 1
+
+	for(int i=0;i<t;i++) {
+
+		int money = Integer.parseInt(br.readLine());
+
+		int a =0, b=0, c=0, d = 0;
+
+		while(true) {
+
+			if(money>=25) {
+				money -= 25;
+				a++;
+			}
+			else if(money>=10) {
+				money -= 10;
+				b++;
+			}
+			else if(money>=5) {
+				money -=5;
+				c++;
+			}
+			else {
+				money -= 1;
+				d++;
+
+			}
+
+			if(money<=0) break;
+
+		}
+
+
+		System.out.println(a+" "+b+" "+c+" "+d);
+
+	}
+
+
+
+
+	}
+
+}

Basic_Of_Algorithm/src/Today_22_05_24/backJoon_greedy_no3.java

@@ -0,0 +1,33 @@
+package Today_22_05_24;
+
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class backJoon_greedy_no3 {
+
+	public static void main(String[] args) throws Exception {
+
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+		String[] input = br.readLine().split("");
+
+        int i = 0;
+        for(String checkA : input) {
+            if(i == 0 && checkA.equals("U")) i++;
+            if((i == 1 || i == 3) && checkA.equals("C")) i++;
+            if(i == 2 && checkA.equals("P")) i++;
+        }
+        if(i==4) {
+            System.out.println("I love UCPC");
+        }else {
+            System.out.println("I hate UCPC");
+        }
+
+
+	}
+
+
+
+
+}

Basic_Of_Algorithm/src/Today_22_05_24/backJoon_greedy_no4.java

@@ -0,0 +1,58 @@
+package Today_22_05_24;
+
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class backJoon_greedy_no4 {
+
+	public static void main(String[] args) throws Exception {
+
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+		int answer = 0;
+
+		int n = Integer.parseInt(br.readLine());
+
+		String s = br.readLine();
+
+		Integer []crain = new Integer[n];
+
+		for(int i=0;i<n;i++) crain[i] = Integer.parseInt(s.split(" ")[i]);	
+
+		Arrays.sort(crain, Collections.reverseOrder());
+
+		int m = Integer.parseInt(br.readLine());
+
+		String s2 = br.readLine();
+
+		PriorityQueue<Integer> q = new PriorityQueue<>(Collections.reverseOrder());
+
+		for(int i=0;i<m;i++) q.add(Integer.parseInt(s2.split(" ")[i]));
+
+		if(q.peek()>crain[0]) answer = -1;
+		else {
+
+			while(!q.isEmpty()) {
+
+				answer++;
+
+				for(int i=0;i<crain.length;i++) {
+
+					if(!q.isEmpty() && crain[i] >= q.peek()) q.poll();
+					if(q.isEmpty()) break;
+
+				}
+
+				if(q.isEmpty()) break;
+
+			}
+		}
+
+
+		System.out.println(answer);
+
+
+	}
+
+}

Basic_Of_Algorithm/src/Today_22_05_24/backJoon_greedy_no5.java

@@ -0,0 +1,18 @@
+package Today_22_05_24;
+
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class backJoon_greedy_no5 {
+
+	public static void main(String[] args) throws Exception {
+
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+
+
+
+	}
+
+}

Basic_Of_Algorithm/src/Today_22_05_24/programmer_lv_2_no_1.java

@@ -0,0 +1,54 @@
+package Today_22_05_24;
+
+public class programmer_lv_2_no_1 {
+
+	public static void main(String[] args) {
+
+
+
+		String s = "aabbaccc";
+
+		int answer = Integer.MAX_VALUE;
+
+
+		for(int i=1;i<=s.length()/2;i++) {
+
+				String result ="";
+				String next = "";
+				String now = "";
+				int hit = 1;
+
+			for(int j=0;j<=s.length()/i;j++) {
+
+				int start = i * j;
+				int end = i * ( j + 1 ) > s.length() ? s.length():i*(j+1) ;
+
+				next = s.substring(start,end);
+
+				if(now.equals(next)) {
+					hit++;
+				}else {
+
+					result += processHit(hit) + now;
+					hit = 1;
+				}
+				now = next;
+
+
+			}
+			result += processHit(hit) + now;
+
+			System.out.println(result + " : " + result.length() + " 개");
+
+			answer = Math.min(answer, result.length());
+		}
+
+		System.out.println("답 :" + answer+" 개 ");
+
+
+	}
+	static String processHit(int hit) {
+		return hit>1 ? String.valueOf(hit) : "";
+	}
+
+}

Basic_Of_Algorithm/src/Today_22_05_24/programmer_lv_2_no_2.java

@@ -0,0 +1,56 @@
+package Today_22_05_24;
+
+import java.util.Queue;
+import java.util.LinkedList;
+import java.util.ArrayList;
+
+public class programmer_lv_2_no_2 {
+
+	public static void main(String[] args) {
+
+		int [] progresses = {95, 90, 99, 99, 80, 99};
+
+		int [] speeds = {1, 1, 1, 1, 1, 1};
+
+		Queue<Integer> q = new LinkedList<>();
+
+		for(int i=0;i<progresses.length;i++) {
+
+			int temp = 0;
+
+
+
+			while(progresses[i]<100) {
+				progresses[i] += speeds[i];
+				temp++;
+			}
+
+			q.add(temp);
+
+		}
+
+
+		ArrayList<Integer> answerList = new ArrayList<>();
+
+		while(!q.isEmpty()) {
+
+			int a = q.poll();
+
+			int answerInt = 1;
+
+			while(!q.isEmpty() && a>= q.peek()) {
+
+				answerInt++;
+				q.poll();
+			}
+
+			answerList.add(answerInt);
+
+		}
+
+		System.out.println(answerList);
+
+
+	}
+
+}