목록Algorithm (127)
main
import java.util.Scanner; public class Main { static void average(int[] arr, int avrg) { int cnt = 0; for (int i : arr) { if (i > avrg) { cnt++; } } System.out.printf("%.3f%%\n", (double) cnt / arr.length * 100); } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); for (int i = 0; i < N; i++) { int N2 = sc.nextInt(); int sum = 0; int[] numbers = n..
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = Integer.parseInt(sc.nextLine()); for (int i = 0; i < N; i++) { int point = 1; int sum = 0; String str = sc.nextLine(); for (char c : str.toCharArray()) { if (c == 'O') { sum += point; point++; } else if (c == 'X') { point = 1; } } System.out.println(sum); } sc.close..
* HashSet 사용 (중복 X, 순서 X) import java.util.HashSet; import java.util.Scanner; import java.util.Set; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); Set set = new HashSet(); for (int i = 0; i < 10; i++) { int num = sc.nextInt(); set.add(num % 42); } System.out.println(set.size()); sc.close(); } }
* BufferedWriter.flush는 맨 마지막에 한 번만 하면 된다. import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; public class Main { public static void main(String[] args) { try { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStream..
* 문자열로 처리 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); StringBuffer sb1 = new StringBuffer(sc.next()); StringBuffer sb2 = new StringBuffer(sc.next()); String str1 = sb1.reverse().toString(); String str2 = sb2.reverse().toString(); char[] num1 = str1.toCharArray(); char[] num2 = str2.toCharArray(); if (num1.length