목록algorithm (26)
남극

package Baekjoon; import java.util.Scanner; public class Baekjoon2441 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); sc.close(); for (int i = 1; i = i; j--) { System.out.print("*"); } System.out.println(); } } }

package Baekjoon; import java.util.Scanner; public class Baekjoon11654 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String s = sc.next(); int sa = s.charAt(0); System.out.println(sa); sc.close(); } }

package Baekjoon; import java.util.Scanner; public class Baekjoon2440 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); sc.close(); for (int i = 1; i = i; j--) { System.out.print("*"); } System.out.println(); } } }

package Baekjoon; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Baekjoon10833 { public static void main(String[] args) throws IOException { BufferedReader bf = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; int n = toInt(bf.readLine()); int result = 0; for (int i = 0; i < n; i..

package Baekjoon; import java.util.Scanner; public class Baekjoon10797 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int cm = 0; int cnt = 0; for (int i = 0; i < 5; i++) { cm = sc.nextInt(); if (n == cm) { cnt++; } } sc.close(); System.out.println(cnt); } }

package Baekjoon; import java.util.Scanner; public class Baekjoon2490 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int cnt = 0; int[] arr = new int[4]; for (int i = 0; i < 3; i++) { cnt = 0; for (int j = 0; j < 4; j++) { arr[j] = sc.nextInt(); if (arr[j] == 1) { cnt++; } } if (cnt == 0) { System.out.println("D"); } else if (cnt == 1) { System.out.println("C"); ..