Hoons

package backjoon; import java.util.*; public class 연습 { public static void main(String[] args) { int[][] arr = new int[100][100]; for (int i = 0; i < arr.length; i++) { for (int j = 0; j < arr.length; j++) { arr[i][j] = 0; // 빈종이로 초기화 } } Scanner sc = new Scanner(System.in); int a = sc.nextInt(); for (int i = 0; i < a; i++) { int x = sc.nextInt(); int y = sc.nextInt(); for (int j = x; j < x + 10..

package backjoon; import java.util.*; public class 연습 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String str = sc.next(); int num = sc.nextInt(); int result = 0; int power = 0; for (int i = str.length() - 1 ; i >= 0 ; i--) { char c = str.charAt(i); int digit = Character.isDigit(c) ? c - '0' : c - 'A' + 10; result += digit * Math.pow(num,power); power++; } Syst..

package backjoon; import java.util.*; public class 중앙이동알고리즘 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int number = sc.nextInt(); int a = (int) Math.pow(Math.pow(2,number) + 1, 2); System.out.println(a); } }

package backjoon; import java.util.*; public class 거스름돈 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); for (int i = 0; i < a; i++) { int price = sc.nextInt(); int[] value = {25,10,5,1}; int[] valueCount = new int[4]; for (int j = 0; j < value.length; j++) { valueCount[j] = price/value[j]; price %= value[j]; } for (int result :valueCount) { S..

package backjoon; import java.util.*; public class 삼각형변계산 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (true){ int a = sc.nextInt(); int b = sc.nextInt(); int c = sc.nextInt(); if(a==0 && b==0 && c==0){ break; } int max = Math.max(a,Math.max(b,c)); if(max < a + b + c - max){ if(a==b && b==c && c==a){ System.out.println("Equilateral"); } else if (a==b || b..