Hoons

import java.util.*; class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int max_x = Integer.MIN_VALUE; int min_x = Integer.MAX_VALUE; int max_y = Integer.MIN_VALUE; int min_y = Integer.MAX_VALUE; for(int i = 0 ; i < n ; i ++){ int x = sc.nextInt(); int y = sc.nextInt(); max_x = Math.max(max_x,x); min_x = Math.min(min_x,x); max_y = Math..

import java.util.*; class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int count = 0; for(int i = 0 ; i < a ; i ++){ int num = sc.nextInt(); boolean isprime = true; //boolean을 사용해서 count if(num

import java.util.*; class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(true){ int n = sc.nextInt(); if(n == -1){ break; } int sum = 0; StringBuilder str = new StringBuilder(); for(int i = 1 ; i < n ; i++){ if(n%i == 0){ sum+=i; str.append(i).append(" + "); //1 + ~~ } } if(sum==n){ str.setLength(str.length() - 3); System.out.println(n + " = " + str); ..

import java.util.*; class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int b = sc.nextInt(); int count = 0; for(int i = 1 ; i

import java.util.*; class HelloWorld { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(true){ int a = sc.nextInt(); int b = sc.nextInt(); if(a==0 && b==0 || a==b){ break; } if(b%a == 0 ){ System.out.println("factor"); } else if(a%b == 0 ){ System.out.println("multiple"); } else{ System.out.println("neither"); } } } } ez함 무한루프에서 a랑 b가 0 이거나 같으면 종료

import java.util.*; class Main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int b = sc.nextInt(); int c = sc.nextInt(); int day = 0; int move = 0; while(c>move){ day++; move+=a; if(c

import java.util.*; class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int layer = 1; // 1 방 부터 시작 int range = 1; while(range < n) range += 6 * layer; //육각형 layer++; } System.out.print(layer); }

import java.util.*; class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String[] str = new String[5]; for(int i = 0 ; i < str.length ; i++){ str[i] = sc.next(); } int max = 0; for(int i = 0 ; i < str.length ; i++){ if(max

import java.util.Scanner; ​ public class Solution { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("숫자 입력") int n = sc.nextInt(); System.out.println(n%2==0 ? n + " is even" : n + " is odd"); } } import java.util.Scanner; ​ public class Solution { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); i..

import java.util.Scanner; ​ public class Solution { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("Hello Word"); String str = sc.next(); int a = str.length(); if( a >= 1 && 1000000 >= a){ System.out.println(str); } } }