Merge branch 'main' of https://github.com/ANA-CNU/ANA-Daily-Algorithm

이수민/17386.c

@@ -0,0 +1,29 @@
+#include <stdio.h>
+#include <stdlib.h>
+typedef struct {
+    long long int x,y;
+}st;
+int ccw(st p1, st p2, st p3) {
+    long long int s = (p1.x*p2.y + p2.x*p3.y + p3.x*p1.y) - (p1.x*p3.y + p2.x*p1.y + p3.x*p2.y);
+    if(s > 0) return 1;
+    else if(s == 0) return 0;
+    return -1;
+}
+int isCross(st p1, st p2, st p3, st p4) {
+    int p1p2 = ccw(p1, p2, p3) * ccw(p1, p2, p4);
+    int p3p4 = ccw(p3, p4, p1) * ccw(p3, p4, p2);
+    return p1p2 <= 0 && p3p4 <= 0;
+}
+int main()
+{
+    int x1,x2,x3,x4,y1,y2,y3,y4;
+    scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
+    scanf("%d %d %d %d",&x3,&y3,&x4,&y4);
+    st p1 = {x1, y1};
+    st p2 = {x2, y2};
+    st p3 = {x3, y3};
+    st p4 = {x4, y4};
+
+    printf("%d",isCross(p1, p2, p3, p4));
+    return 0;
+}

진민혁/S3_17413

@@ -0,0 +1,42 @@
+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));
+        String s = br.readLine();
+        Stack<Character> st1 = new Stack<>();
+        Stack<Character> st2 = new Stack<>();
+        StringBuilder sb = new StringBuilder();
+        for(int i=0; i<s.length(); i++) {
+        	char c = s.charAt(i);
+        	if(c=='<') {
+        		while(st1.size() > 0)
+        			sb.append(st1.pop());
+        		st2.add(c);
+
+        	}
+        	if(st2.size()==0) {
+        		if(c == ' ') {
+        			while(st1.size() > 0) {
+        				sb.append(st1.pop());
+        			}
+        			sb.append(c);
+        		}
+        		else
+        			st1.add(c);
+        	}
+        	if(st2.size() > 0 && st2.peek() == '<') { //괄호 안에 있으면 그대로 출력
+        		sb.append(c);
+        	}
+        	if(c=='>') { // 닫히면 열린거 삭제하고 그대로 출력
+        		st2.pop();
+        	}
+
+        }
+        while(st1.size() > 0) {
+        	sb.append(st1.pop());
+        }
+        System.out.println(sb);
+    }   
+}          

진민혁/S4_1620

@@ -0,0 +1,25 @@
+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));
+        String[] input = br.readLine().split(" ");
+        int n = Integer.parseInt(input[0]);
+        int m = Integer.parseInt(input[1]);
+        HashMap<String,String> map = new HashMap<>();
+
+        for(int i=1; i<=n; i++) {
+        	String s1 = Integer.toString(i);
+        	String s2 = br.readLine();
+        	map.put(s1, s2);
+        	map.put(s2, s1);
+        }
+        StringBuilder sb = new StringBuilder();
+        for(int i=0; i<m; i++) {
+        	String str = br.readLine();
+        	sb.append(map.get(str) + "\n");
+        }
+        System.out.println(sb);
+    }   
+}          

진민혁/S4_2164

@@ -0,0 +1,20 @@
+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));
+
+        int n = Integer.parseInt(br.readLine());
+        Queue<Integer> q = new LinkedList<>();
+        for(int i=1; i<=n; i++) {
+        	q.add(i);
+        }
+        while(q.size() != 1) {
+        	q.poll();
+        	int tmp = q.poll();
+        	q.add(tmp);
+        }
+        System.out.println(q.peek());
+    }   
+}          

진민혁/S5_11866

@@ -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));
+        String[] input = br.readLine().split(" ");
+        int n = Integer.parseInt(input[0]);
+        int k = Integer.parseInt(input[1]);
+        int cnt = 0;
+        Queue<Integer> q = new LinkedList<>();
+        StringBuilder sb = new StringBuilder();
+        sb.append("<");
+        for(int i=1; i<=n; i++) {
+        	q.add(i);
+        }
+        while(q.size()>1) {
+        	int tmp = q.peek();
+        	q.remove();
+        	cnt ++;
+        	if(cnt%k == 0) {
+        		sb.append(tmp + ", ");
+        	}
+        	else {
+        		q.add(tmp);
+        	}
+        }
+        sb.append(q.peek() + ">");
+        System.out.println(sb);
+    }   
+}