전체 글

개발공부리뷰블로그
· 알고리즘
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
· 알고리즘
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
· 알고리즘
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
· 알고리즘
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..
· 알고리즘
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
WHITE_FROST
하얀하얀IT