package String;

public class cospro_3_5_happybirthday {

   static public String solution(String phrases, int second) {
        String answer = "";
        String display = "";
        display = "______________" + phrases;
        
        for(int i = 0; i < second; ++i) {
        	System.out.println(display +  " "+Character.toString(display.charAt(0)));
        	
        	//display 맨앞거를 뒤에 붙이고
        	display = display + Character.toString(display.charAt(0));

        	//맨앞을 제거한다
        	display = display.substring(1);
        }
        
        //앞에서부터 14개만
        answer = display.substring(0,14);
        return answer;
    }
	
	public static void main(String[] args) {
		String s = "happy-birthday";
		System.out.println(solution(s, 20));
		
	}
}

package String;

public class cospro_3_4_겹치는문자열합치기 {
	public static void main(String[] args) {
		String s1 = "ababc";
		String s2 = "abcdab";
		
		int len=0;
		
		if(s1.length()>s2.length())
			len=s2.length();
		else
			len= s1.length();
			
		String a1 = "";
		String a2 = "";
		
		int num = 1;
		for(int i=0; i<len; i++,num++) {
			if(s1.substring(s1.length()-num,s1.length()).equals(s2.substring(0, num)))
				a1 = s1.substring(0,s1.length()-i-1) + s2;
		}
		
		num= 1;
		for(int i=0; i<len; i++,num++) {
			if(s2.substring(s2.length()-num,s2.length()).equals(s1.substring(0, num)))
				a2 = s2.substring(0,s2.length()-i-1) + s1;
		}
		
		System.out.println("1" + a1);
		System.out.println("2" + a2);
 	}
}

package Math;

public class cospro_3_7_숫자분리하기 {

	public static void main(String[] args) {
		int a = 123456789;
		
		int divisor = 1;
		while(a/divisor !=0) { //a%divisor면 들어가지도 않고 끝남
			int f = a/divisor;
			int b = a%divisor;
			
			divisor *= 10;
			
			System.out.println(f + "  " + b);
		}
	}
}

package 이분탐색;

import java.util.*;

public class prog_3_입국심사 {

	static public long solution(int n, int[] times) {
        long answer = Long.MAX_VALUE;
        
        long left = 0;
        long right = 0;
        long mid;
        
        for (int time : times) {
            if (time > right) {
                right = time;
            }//right에 max값 담는다
        }

        right *= n; //최대 오래걸리는 사람이 다 계산할 경우
        
        while(left<=right) {
        	mid = (left+right)/2;
        	
        	long temp = 0;
        	for(int time:times) {
        		temp += mid/time;
        	}
        	if(temp <n)
        		left = mid+1;
        	else {
                //답이 될 수 있는 것은 이곳에!!
        		if(mid<answer)//mid가 더 작으면 answer에 넣는다
        			answer = mid;
        		
        		right = mid-1;
        	}	
        }
        return answer;
    }
	
	
	public static void main(String[] args) {
		int t[] = {7,10};
		
		System.out.println(solution(6,t));
	}
}

package Dfs_Bfs;

//15min
import java.util.*;
public class prog_re_가장먼노드 {

    static public int solution(int n, int[][] edge) {
        int answer = 0;
        
        //1에서 n까지 가는 최소 경로들을 다 저장해놓는 배열
        int root[] = new int[n+1];
        
        Queue<Integer> qu = new LinkedList<>();
        
        qu.add(1);
        root[1] = 1;
        
        int max = 0;
        
        while(!qu.isEmpty()) {
        	int now = qu.poll();
        	
        	for(int i=0; i<edge.length; i++) {
        		if(now==edge[i][0] && root[edge[i][1]] ==0) {
        			root[edge[i][1]] += root[now]+1;
        			qu.add(edge[i][1]);
        			max = Math.max(max, root[edge[i][1]]);
        		}
        		
        		if(now==edge[i][1] && root[edge[i][0]] ==0) {
        			root[edge[i][0]] += root[now]+1;
        			qu.add(edge[i][0]);
        			max = Math.max(max, root[edge[i][0]]);
        		}
        	}
        	
        }     
        
        for(int i : root) {
        	if(max == i)
        		answer++;
        }
        
        return answer;
    }	
}