본문 바로가기

알고리즘 & 자료구조569

백준 1012 2022. 2. 13.
백준 2178 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class Main2178 { public static int[] dy = {-1,0,1,0}; public static int[] dx = {0,1,0,-1}; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader.. 2022. 2. 12.
백준 4375_1 import java.util.Scanner; public class Main4375_1 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(sc.hasNextInt()) { int N = sc.nextInt(); int num = 0; int ans = 1; while(true) { num = ((num * 10) + 1)%N; //오버플로우 방지 if(num == 0) { System.out.println(ans); break; } ans++; } } } } 2022. 2. 11.
백준 1629 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main1629 { static long A,B,C; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st= new StringTokenizer(br.readLine()); A = Integer.parseInt(st.nextToken()); .. 2022. 2. 10.
백준 3986 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Stack; public class Main3986 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); //단어의 수 N //선이 겹치지 않는 조건 // 1. 같은 글자끼리 붙어있을 때 // 2. 한 글자는 붙어있고 양 옆에 다른 글자가 있을 때 in.. 2022. 2. 9.
백준 1940 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main1940 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); // 재료의 개수 N int M = Integer.parseInt(br.readLine()); // 갑옷을 만드는데 필요한 수 M.. 2022. 2. 8.