https://www.acmicpc.net/problem/31403
https://www.acmicpc.net/problem/30802
백준을 오랜만에 풀려했더니
입력받는 방법을 완전 까먹어서 감을 잡고자 풀었다.
이전에 공부했던 Stream을 활용하여
배열로 바로 넣어서 계산하여 정답을 출력하였다.
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class b31403 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int a = Integer.parseInt(br.readLine());
int b = Integer.parseInt(br.readLine());
int c = Integer.parseInt(br.readLine());
System.out.println((a+b-c));
System.out.println((Integer.parseInt(String.valueOf(a)+String.valueOf(b))-c));
}
}
//=====================================================================================
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class b30802 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader((System.in)));
Long N = Long.parseLong(br.readLine());
long[] arr = Arrays
.stream(br.readLine().split(" "))
.mapToLong(Long::parseLong)
.toArray();
long[] pf = Arrays.stream(br.readLine().split(" "))
.mapToLong(Long::parseLong)
.toArray();
long ans = 0;
for(int i = 0 ; i < arr.length ; i++) {
ans += arr[i] / pf[0];
ans = arr[i] % pf[0] == 0 ? ans : ans+1;
}
System.out.println(ans);
System.out.println(N/pf[1]+" "+N%pf[1]);
}
}
'Algorithm & Data Structures > BOJ' 카테고리의 다른 글
b1005. ACMcraft (0) | 2024.10.29 |
---|---|
b28702, b30804 (0) | 2024.10.10 |
2776. 암기왕 (Java) (1) | 2024.01.27 |
12015. 가장 증가하는 부분수열 2 (Java) (0) | 2024.01.10 |
1865. 웜홀 (Java) (1) | 2024.01.02 |