Total

Computer Science (CS)/알고리즘

[백준/Java] 14215번 세 막대

문제 정답 풀이 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int a = Integer.parseInt(st.nextToken()); int b = I..

Computer Science (CS)/알고리즘

[백준/Java] 5073번 삼각형과 세 변

문제 정답 풀이 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; while(true){ st = new StringTokenizer(br.readLine()); int n1 = Integer.parseInt(st.nextT..

Computer Science (CS)/알고리즘

[백준/Java] 10101번 삼각형 외우기

문제 정답 풀이 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n1 = Integer.parseInt(br.readLine()); int n2 = Integer.parseInt(br.readLine()); int n3 = Integer.parseInt(br.readLine()); if(n1 == n2 && n..

Computer Science (CS)/알고리즘

[백준/Java] 9063번 대지

문제 정답 풀이 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; int minX = 10001; int minY = 10001; int maxX = -10001; int maxY = -10001; int N = Intege..

Computer Science (CS)/알고리즘

[백준/Java] 15894번 수학은 체육과목 입니다

문제 정답 풀이 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); long n = Long.parseLong(br.readLine()); System.out.println(4*n); br.close(); } } 메모리 14220KB 시간 128ms 문제에 사각형을 직접 세어보니 입력의 4배로 값이 나오는 것을 알 수 있..

Computer Science (CS)/알고리즘

[백준/Java] 3009번 네 번째 점

문제 정답 풀이 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine(), " "); int x1 = Integer.parseInt(st.nextToken()); int..

Computer Science (CS)/알고리즘

[백준/Java] 직사각형에서 탈출

문제 정답 풀이 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int x = Integer.parseInt(st.nextToken()); int y = I..

Computer Science (CS)/알고리즘

[백준/Java] 27323번 직사각형

문제 정답 풀이 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int A = Integer.parseInt(br.readLine()); int B = Integer.parseInt(br.readLine()); System.out.print(A*B); br.close(); } } 메모리 14116KB 시간 120ms

Computer Science (CS)/알고리즘

[백준/Java] 11653번 소인수분해

문제 정답 풀이 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; 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()); int i = 2; while(N != 1){ if(N%i == 0){ System.out.println(i); N = ..

Computer Science (CS)/알고리즘

[백준/Java] 2581번 소수

문제 정답 풀이 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int M = Integer.parseInt(br.readLine()); int N = Integer.parseInt(br.readLine()); int sum = 0; int min = N+1..

eune7
'분류 전체보기' 카테고리의 글 목록 (4 Page)