main

import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer stk = new StringTokenizer(br.readLine(), " "); int N = Integer.parseInt(stk.nextToken()); int K = Integer.parseInt(stk.nextToken()); int[] coinList = new int[N]; int maxCoinIndex = -1; for (..

* BFS ; queue 사용 import java.io.*; import java.util.*; public class Main { static int[][] arr; // 전체 상태 배열 static Queue agedTomato; // 숙성된 토마토 칸 배열 static int M; static int N; static int day = 0; private static class Cann { int x; int y; public Cann(int x, int y) { this.x = x; this.y = y; } @Override public boolean equals(Object o) { if (o instanceof Cann) { return x == ((Cann) o).x && y == ((Ca..

* 그래프 알고리즘 공부해서 다시 짜기 import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws IOException { Scanner in = new Scanner(System.in); int N = in.nextInt(); int[][] graph = new int[N][N]; // 그래프의 인접 행렬 for (int i = 0; i < graph.length; i++) { for (int j = 0; j < graph.length; j++) { graph[i][j] = in.nextInt(); } } // 2번 반복해야 정답 (이유는 모르겠음.) int repeat = 2..

* Map 을 사용하여 풀었다. import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws IOException { Scanner in = new Scanner(System.in); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); int N = in.nextInt(); int M = in.nextInt(); HashMap map = new HashMap(); for (int i = 0; i < N; i++) { String url = in.next(); String pass = in.next(..

* dp * 배열 형태로 최대값 저장하면서 푼다. import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws IOException { Scanner in = new Scanner(System.in); int N = in.nextInt(); int[] sumList = new int[N + 1]; int[] tmpList = new int[N + 1]; int max_value = -1; for (int i = 1; i < N + 1; i++) { for (int j = 1; j < i + 1; j++) { int num = in.nextInt(); if (j == 0) { sum..