728x90
반응형
1.8
문제번호 9086
package baekjoon;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Scanner;
public class java_0108 {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int T = sc.nextInt();
for(int i=0; i<T; i++) {
String S = sc.next().toUpperCase();
bw.write(S.charAt(0));
bw.write(S.charAt(S.length()-1) + "\n");
}
bw.flush();
bw.close();
sc.close();
}
}
1.9
문제번호 11654
package baekjoon;
import java.util.Scanner;
public class java_0109 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
char a = sc.nextLine().charAt(0);
int num = (int)a;
System.out.println(num);
}
}
1.10
문제번호 11720
package baekjoon;
import java.util.Scanner;
public class java_0110 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
String a = sc.next();
int sum = 0;
for(int i=0; i<a.length(); i++) {
sum += Integer.parseInt(a.substring(i, i+1));
}
System.out.println(sum);
}
}
1.11
문제번호 10809
package baekjoon;
import java.util.Scanner;
public class java_0111 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[] alpha = new int[26];
for(int i=0; i<alpha.length; i++) {
alpha[i] = -1;
}
String s = sc.next().toLowerCase();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if (alpha[(int)c - 97] == -1) {
alpha[(int)c - 97] = i;
}
}
for (int i = 0; i < 26; i++) {
System.out.print(alpha[i] + " ");
}
}
}
1.12
문제번호 2675
package baekjoon;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Scanner;
public class java_0112 {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int T = sc.nextInt();
for(int i=0; i<T; i++) {
int R = sc.nextInt();
String S = sc.next();
for(int j=0; j<S.length(); j++) {
for(int k=0; k<R; k++) {
bw.write(S.charAt(j));
}
}
bw.write("\n");
}
bw.flush();
bw.close();
}
}728x90
반응형
'Study > ☁️ 1일 1문제' 카테고리의 다른 글
| [1일 1문제] 백준 단계별로 풀어보기 2-6번 (1.22~1.26) (2) | 2024.01.26 |
|---|---|
| [1일 1문제] 백준 단계별로 풀어보기 8-11, 1번 (1.15~1.19) (2) | 2024.01.19 |
| [1일 1문제] 백준 단계별로 풀어보기 8-10번, 1-2번 (1.1~1.5) (1) | 2024.01.05 |
| [1일 1문제] 백준 단계별로 풀어보기 4-7번 (12.26~12.29) (1) | 2023.12.29 |
| [1일 1문제] 백준 단계별로 풀어보기 11-12번, 1-3번 (11.20~11.24) (3) | 2023.11.24 |