너T야? 나 T(story)야….

import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class Bera { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); int result = N*(N-1); System.out.println(result); }}

import java.io.BufferedReader;import java.io.InputStreamReader;import java.io.IOException;import java.util.ArrayDeque;import java.util.Deque;import java.util.StringTokenizer;public class PoppingBalloons { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(b..

import java.io.BufferedReader;import java.io.BufferedWriter;import java.io.InputStreamReader;import java.io.OutputStreamWriter;import java.util.ArrayDeque;import java.util.Deque;public class Deck2 { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputS..

import java.util.List;import java.util.ArrayList;import java.util.Scanner;public class Josephus0 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int K = sc.nextInt(); List list = new ArrayList(); List result = new ArrayList(); for (int i = 1; i "); }}

문제  내 풀이 1 : for문을 이용한 풀이.import java.io.BufferedReader;import java.io.InputStreamReader;import java.util.ArrayDeque;import java.util.Deque;public class Card2 { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); Deque d = new ArrayDeque(); int N = Integer.parseInt(br.readLine()); //N개 ..

문제 풀이import java.io.BufferedReader;import java.io.InputStreamReader;import java.util.ArrayDeque;import java.util.Deque;public class Que2 { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); Deque q = new ArrayDeque(); StringBuilder sb = new StringBuilder(); int N = Integer.parseInt(br...

문제 풀이import java.io.BufferedReader;import java.io.InputStreamReader;import java.io.IOException;import java.util.Stack;public class BalanceWorld { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuilder sb = new StringBuilder(); String s; while(true) { s = br.readL..

문제 풀이풀이 1: Stack 을 이용한 풀이import java.util.Scanner;import java.util.Stack;public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); Stack stack = new Stack(); int K = sc.nextInt(); for (int i = 0; i  풀이 2 : 배열을 이용한 풀이public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); ..

문제  내 풀이import java.util.Scanner;public class Stack2 { public static int[] stack; public static int size = 0; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(System.in); StringBuilder sb = new StringBuilder(); int N = sc.nextInt(); stack = new int[N]; for(int i = 0; i  기본적인 Stack 문제

문제 내 풀이import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class GoldbachPartition { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int T = Integer.parseInt(br.readLine()); int maxN = 1000000; boolean[] isPrime = new boolean[maxN + 1];..