프로그래밍/알고리즘 풀이69 [알고리즘] 백준 4153번 직각삼각형 Java 이번 문제는 피타고라스 정의로 풀어 낼수 있다. 세변중 작은 두변을 a , b 가장큰변을 c 라고 할때 a*a+b*b=c*c를 만족하면 직각 삼각형이다. 그리고 문제를 잘 보면 '변의 길이'만 나와 있지 어떤게 큰지 작은지 알 수 없다. 따라서 정렬을 한 후 공식에 대입하여 풀어야 한다. import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.Arrays; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws Exception{ BufferedReader br = new BufferedRea.. 2021. 4. 29. [알고리즘] 백준 6603번 로또 Java import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.*; public class Main { static int k; static int [] s; static boolean [] chk; public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); while(true){ String testCase=br.readLine(); if(testCase.equals("0")) break; String [] input=testCase.split(.. 2021. 4. 27. [알고리즘] 백준 1966번 AC큐 Java import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.ArrayDeque; import java.util.Deque; import java.util.Iterator; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); for(int i=0;i 2021. 4. 22. [알고리즘] 백준 1966번 프린터 큐 Java import java.io.*; import java.util.*; public class BaekJoon1966 { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); for(int i=0;i 2021. 4. 22. [알고리즘] 백준 11720번 숫자의 합 Java import java.io.BufferedReader; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws Exception { int N, result = 0; BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); N = Integer.parseInt(br.readLine()); String number = br.readLine(); for(int i=0;i 2021. 4. 20. [알고리즘] 백준 10950번 A+B - 3 Java import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N=Integer.parseInt(br.readLine()); StringBuilder sb = new StringBuilder(); for(int i=0;i 2021. 4. 15. [알고리즘] 백준 2438번 별 찍기 -1 Java import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N=Integer.parseInt(br.readLine()); StringBuilder sb = new StringBuilder(); for(int i=1;i 2021. 4. 15. [알고리즘] 백준 1158번: 요세푸스 JAVA import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { int N,k = 0; BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String nk=br.readLine(); N = Integer.parseInt(nk.split(" ")[0]); k = Integer.parseInt(nk.split(" ")[1]); StringBuilder sb = new StringBuilder(); List list=new ArrayList(); for(int i=1;i1){ sb.app.. 2021. 4. 13. [알고리즘] 백준 1874번: 스택 수열 JAVA import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { int N = 0; BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); boolean resultBool=true; N = Integer.parseInt(br.readLine()); Stack stack =new Stack(); Stack resultStack =new Stack(); StringBuilder sb = new StringBuilder(); for(int i=N;i>0;i--){ stack.push(i); .. 2021. 4. 12. [알고리즘] 백준 9012번: 괄호 JAVA import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { int N = 0; BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); N = Integer.parseInt(br.readLine()); StringBuilder sb = new StringBuilder(); for(int i=0;i 2021. 4. 6. [알고리즘] 백준 10816번: 숫자 카드2 JAVA import java.io.*; public class Main { public static void main(String[] args) throws Exception{ int N,M=0; int [] plusNum=new int[10000001]; int [] minusNum=new int[10000001]; BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); N = Integer.parseInt(br.readLine()); String[]strNum=br.readLine().split(" "); M = Integer.parseInt(br.readLine()); String[]strmNum=br.readLine().spli.. 2021. 4. 3. 백준 10867번 : 중복 빼고 정렬하기 JAVA import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n=Integer.parseInt(br.readLine()); int [] plusNum=new int[1001]; int [] minusNum=new int[1001]; String [] strArr=br.readLine().split(" "); StringBuffer strBuffer=new StringBuffer(); for(int i=0;i=0) { plus.. 2021. 1. 14. [알고리즘] 백준 11650, 11651번: 좌표 정렬하기, 좌료 정렬하기2 JAVA 백준 11650, 11651번 좌표정렬하기, 좌표정렬하기2 Collection.sort 와 comare 메소드를 람다식으로 작성하여 구현하였습니다. import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n=Integer.parseInt(br.readLine()); List list=new ArrayList(); for(int i=0;i { return (s1[0]!=s2[0])?Integer.compare(s1[0],.. 2021. 1. 14. [알고리즘] 백준 1181번: 단어정렬 JAVA import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n=Integer.parseInt(br.readLine()); Set strSet = new HashSet(); for(int i=0;i{ return (s1.length()-s2.length()!=0)?Integer.compare(s1.length(),s2.length()):s1.compareTo(s2); }); for (String str : strArray) .. 2021. 1. 7. [알고리즘] 백준 1026번: 보물 JAVA import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n=Integer.parseInt(br.readLine()); String[] aArr = br.readLine().split(" "); String[] bArr = br.readLine().split(" "); int [] A=new int[n]; int [] B=new int[n]; for (int i = 0; i < n; i++) { A[i]=Integer.p.. 2021. 1. 3. [알고리즘] 백준 10866번: 덱 JAVA import java.io.*; import java.util.ArrayDeque; class MyDeque extends ArrayDeque{ StringBuilder sb; MyDeque(){ super(); sb = new StringBuilder(); } void sendMethod(String[] strArr){ switch (strArr[0]) { case "push_front"://정수 X를 덱의 앞에 넣는다. addFirst(Integer.parseInt(strArr[1])); break; case "push_back": //정수 X를 덱의 뒤에 넣는다. addLast(Integer.parseInt(strArr[1])); break; case "pop_front": Integer f=pol.. 2020. 12. 27. 이전 1 2 3 4 5 다음 반응형
