Tastynut

import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); sc.nextLine(); int[][] arr = new int[n][2]; for (int i = 0; i < arr.length; i++) { String info = sc.nextLine(); String[] arrInfo = info.split(" "); arr[i][0] = Integer.parseInt(arrInfo[0]); arr[i][1] = Integer.parseInt(arrInfo[1]); } for (int j = 0; j < arr...

import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int ger = 1; while (ger != n) { int sum = 0; int digit = ger; int bound = (int) Math.log10(digit); for (int i = 0; i

import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int m = sc.nextInt(); int[] arr = new int[n]; for (int i = 0; i < arr.length; i++) { arr[i] = sc.nextInt(); } int max = 0; for (int q = 0; q

import java.io.*; import java.util.*; public class Main { private static final StringBuilder output = new StringBuilder(); static void move(int no, int x, int y) { if (no > 1) move(no - 1, x, 6 - x - y); output.append(x).append(" ").append(y).append("\n"); if (no > 1) move(no-1,6-x-y,y); } public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new Inpu..

: 힌트 2차원 배열을 활용해 보자. package doit.chap5.실습; import java.util.*; public class Main { static String pattern(int n) { String head; String body; String bottom; if (n == 3) { head = "***"; body = "* *"; bottom = "***"; } else { head = pattern(n / 3).repeat(n / 3); body = pattern(n / 3) + pattern(n / 3).replace("*", " ") + pattern(n / 3); bottom = pattern(n / 3).repeat(n / 3); } return head + "\n" + b..

package tnut.blogback.model; import com.fasterxml.jackson.annotation.JsonIgnore; import lombok.AllArgsConstructor; import lombok.Builder; import lombok.Data; import lombok.NoArgsConstructor; import org.hibernate.annotations.CreationTimestamp; import javax.persistence.*; import java.sql.Timestamp; import java.util.ArrayList; import java.util.List; import java.util.Optional; @Data @AllArgsConstruc..

import java.util.*; public class Main { static void answer(int n, int a) { StringBuilder distinguish = new StringBuilder(); distinguish.append("____".repeat(Math.max(0, a))); System.out.println(distinguish+"\"재귀함수가 뭔가요?\""); if (n == 0) { System.out.println(distinguish+"\"재귀함수는 자기 자신을 호출하는 함수라네\""); } else { System.out.println(distinguish+"\"잘 들어보게. 옛날옛날 한 산 꼭대기에 이세상 모든 지식을 통달한 선인이 있었어."); Syste..

import java.util.*; public class Main { static int factorial(int n) { if (n

import java.util.*; public class Main { static int fibonacci(int n) { if (n == 0 ) { return 0; } else if (n == 1) { return 1; } return fibonacci(n-1) + fibonacci(n-2); } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); System.out.println(fibonacci(n)); } }

import java.util.*; public class Main { static boolean prime(int m) { if (m != 1) { for (int j = 2; j