반응형 softeer17 [Softeer] Lv1: 메리 크리스마스(9660) 문제- 링크: https://softeer.ai/practice/9660 풀이더보기import java.io.*;import java.util.*;public class Main { public static void main(String[] args) { String xMas = "## ## ## ##### ##### ## ## ## ## ## ## ## ####\n" + "## ## #### ## ## ## ## ## ## ## ## ### ### #### ## ##\n" + "#.. 2025. 2. 9. [Softeer] Lv1: 나무 출력(9655) 문제- 링크: https://softeer.ai/practice/9655 풀이더보기import java.io.*;import java.util.*;public class Main { public static void main(String[] args) { String tree = " ********* \n" + " ***** **** \n" + " ** ** \n" + " * * \n" + " ** ** \n".. 2025. 2. 9. [Softeer] Lv1: 효도의 시작(7724) 문제- 링크: https://softeer.ai/practice/7724 풀이더보기import java.io.*;import java.util.*;public class Main { public static void main(String[] args) { System.out.print("엄마 아빠 사랑해요!"); }} 2025. 2. 9. [Softeer] Lv1: 개표(7698) 문제- 링크: https://softeer.ai/practice/7698 풀이더보기import java.io.*;import java.util.*;public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); for (int i = 0; i 2025. 2. 9. [Softeer] Lv1: Tren del Fin del Mundo(7695) 문제- 링크: https://softeer.ai/practice/7695 풀이더보기import java.io.*;import java.util.*;public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int locX = 1_000; int locY = 1_000; for (int i = 0; i 2025. 2. 9. [Softeer] Lv1: 연탄 배달의 시작(7626) 문제- 링크: https://softeer.ai/practice/7626 풀이더보기import java.io.*;import java.util.*;public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); long[] towns = new long[n]; for (int i = 0; i 2025. 2. 9. [Softeer] Lv1: 나무 심기(7353) 문제- 링크: https://softeer.ai/practice/7353 풀이더보기import java.io.*;import java.util.*;public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] ground = new int[n]; for (int i = 0; i b) ? a : b; System.out.println(maxValue); }} 2025. 2. 9. [Softeer] Lv1: A+B(6295) 문제- 링크: https://softeer.ai/practice/6295 풀이더보기import java.io.*;import java.util.*;public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); for (int i = 0; i 2025. 2. 9. [Softeer] Lv1: 근무 시간(6254) 문제- 링크: https://softeer.ai/practice/6254 풀이더보기import java.io.*;import java.util.*;public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int totalMinute = 0; for (int i = 0; i 2025. 2. 8. [문제모음] Softeer(Java): Lv5 총 8문제(2025.02.08 기준) 1-8번 문제더보기문제(문제번호)문제 링크풀이복잡한 조립라인2()문제 링크풀이쿼리는 락이 아니다()문제 링크풀이Hanyang Cherry Picking Contest()문제 링크풀이저녁 뭐 먹지?()문제 링크풀이XNOR의 반란()문제 링크풀이선물 나눠주기 Hard()문제 링크풀이레이저 게임()문제 링크풀이축제()문제 링크풀이 2025. 2. 8. 이전 1 2 다음 반응형
