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

import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.Stack;public class Pipe { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String input = br.readLine(); Stack stack = new Stack(); int result = 0; for (int i = 0; i

import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class ReverseWord2 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String input = br.readLine(); StringBuilder sb = new StringBuilder(); boolean inValid = false; StringBuilder..

아래처럼 풀었더니 1sec , 430 msec 가 떠서 런타임 오류가 발생하였다. 그래서 StringBuild로 풀기로 하였다.import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class Hanoi { static int count = 0; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine());..

import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class Star1 { //2차원 배열 생성 private static char[][] pattern; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuilder sb = new StringBuilder(); int N = Integer.parseInt(br.readLine()..

import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class Fibonacci { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); int[] arr = new int[N + 1]; arr[0] = 0; arr[1] = 1; // ..

import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class Factorial2 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); if(N>=0 && N 왜 틀렸나 했더니 fact를 integer로 받아서 범위 초과로 틀린 것이였다.그래서 long으로 바꿔주었다.

import java.io.*;import java.util.*;/*1.자주 나오는 단어일수록 앞에 배치한다.2.해당 단어의 길이가 길수록 앞에 배치한다.3.알파벳 사전 순으로 앞에 있는 단어일수록 앞에 배치한다 */public class HardWord { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); StringTokenizer st ..

import java.util.Arrays;import java.util.HashMap;import java.util.Map;import java.util.Scanner;public class Statistics { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int[] arr = new int[N]; int sum = 0; Map frequency = new HashMap(); for (int i = 0; i entry : frequency.entrySet()) { in..

import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.HashSet;import java.util.Set;public class ChongChong { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); Set s = new HashSet(); s.add("..

import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.HashSet;import java.util.Set;public class GomGomE { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); Set set = new HashSet(); int count = 0; int N = Integer.parseInt(br.readLi..