Yeun's devlog

import java.util.Scanner; // 1193분수찾기 public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int x = in.nextInt(); in.close(); int cnt = 0; int sum = 0; int a = 0; int b = 0; while (x > sum) { cnt++; sum += cnt; } // 짝수일 경우 if (cnt % 2 == 0) { a = cnt - (sum - x); b = cnt + ((sum - cnt) - x) + 1; } else { a = cnt + ((sum - cnt) - x) +1; b = cnt - (sum -..

import java.util.Scanner; // 2292벌집 public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); in.close(); int around = 1; int cnt = 0; for (int i = 0; i

import java.util.Scanner; // 2903중앙 이동 알고리즘 public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); // 중앙 점을 찍는 과정의 수 in.close(); if (1

import java.util.Scanner; // 2720세탁소 사장 동혁 public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); /** * Quarter: $0.25 * Dime: $0.10 * Nickel: $0.05 * Penny: $0.01 */ int t = in.nextInt(); // 테스트 케이스 수 int[] change = {25, 10, 5, 1}; // 잔돈종류 for (int i = 0; i < t; i++) { int cash = in.nextInt(); int last = cash; for (int j = 0; j < change.length; j++) { ..

import java.util.Scanner; // 11005진법 변환 2 public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); // 10진법 수 int b = in.nextInt(); // 진법 in.close(); StringBuilder sb = new StringBuilder(); while (n != 0) { int last = n % b; String res = ""; if (last >= 10 ) { char c = (char) ((int) last + 55); res = Character.toString(c); } else { re..

import java.util.Scanner; // 2745진법 변환 public class BaseConversion { public static void main(String[] args) { Scanner in = new Scanner(System.in); String n = in.next(); // 수 int b = in.nextInt(); // 진법 in.close(); int res = 0; int num = 0; for (int i = n.length() - 1, cnt = 0; i >= 0; i--, cnt++) { char c = n.charAt(i); if (c >= '0' && c

import java.util.Scanner; // 2563색종이 public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int pprCnt = in.nextInt(); int res = 0; int[][] arr = new int[100][100]; for (int i = 0; i < pprCnt; i++) { int x = in.nextInt(); int y = in.nextInt(); for (int j = x; j < x+10; j++) { for (int k = y; k < y+10; k++) { arr[j][k] = 1; } } } in.close(); for (int i =..

import java.util.Scanner; // 10798세로읽기 public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); char[][] arr = new char[5][15]; for (int i = 0; i < 5; i++) { String s = in.nextLine(); for (int j = 0; j < s.length(); j++) { arr[i][j] = s.charAt(j); } } for (int i = 0; i < 15; i++) { for (int j = 0; j < arr.length; j++) { if (arr[j][i] == '\0') { continue; ..

import java.util.Scanner; // 2566최댓값 public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int[][] arr = new int[9][9]; int maxNum = 0; int row = 0; int col = 0; for (int i = 0; i < arr.length; i++) { for (int j = 0; j < arr.length; j++) { arr[i][j] = in.nextInt(); maxNum = Math.max(arr[i][j], maxNum); } } in.close(); for (int i = 0; i < arr.length; i+..

import java.util.Scanner; // 2738행렬 덧셈 public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int m = in.nextInt(); int[][] a = new int[n][m]; int[][] b = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { a[i][j] = in.nextInt(); } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { b[i][j] = in.ne..