[SWEA][D2] 1284. 수도 요금 경쟁 Java
·
알고리즘 문제풀이
import java.util.Scanner; public class waterBill { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T; T = sc.nextInt(); for (int test_case = 1; test_case
[SWEA][D2] 1204 1일차 - 최빈수 구하기 Java
·
알고리즘 문제풀이
import java.util.Scanner; import java.io.FileInputStream; public class modeQuiz { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T; T = sc.nextInt(); int [] arrays; for (int test_case = 1; test_case
[SWEA][D2] 1946. 간단한 압축 풀기 Java
·
알고리즘 문제풀이
import java.util.Scanner; public class simpleDecode { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T; T = sc.nextInt(); for (int test_case = 1; test_case
[SWEA][D2] 1948. 날짜 계산기 Java
·
알고리즘 문제풀이
import java.util.Scanner; public class dateCal { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T; T=sc.nextInt(); int[] dateArray = {0 , 0 , 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365}; for(int test_case = 1; test_case
[SWEA][D2] 1954. 달팽이 숫자 Java
·
알고리즘 문제풀이
import java.util.Scanner; public class snailQuiz { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T; T=sc.nextInt(); for(int test_case = 1; test_case = N || ny = N || snailArray[nx][ny] != 0){ d = (d + 1) % 4; //방향바꿈 nx = xIndex + dx[d]; ny = yI..
[SWEA][D2] 1959. 두 개의 숫자열 Java
·
알고리즘 문제풀이
import java.util.Scanner; import java.io.FileInputStream; public class twoArray { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T; T = sc.nextInt(); for (int test_case = 1; test_case M) { // A가 더클경우 for (int i = 0; i