Problem Solving/Baekjoon1338 [백준] 18312 시각 - Brute Force / Java • 문제 링크 18312번: 시각 정수 N과 K가 입력되었을 때 00시 00분 00초부터 N시 59분 59초까지의 모든 시각 중에서 K가 하나라도 포함되는 모든 시각을 세는 프로그램을 작성하시오. 시각을 셀 때는 디지털 시계를 기준으로, www.acmicpc.net • 풀이 코드 import java.io.BufferedWriter; import java.io.IOException; import java.io.OutputStreamWriter; public class Main { public static void main(String[] args) throws IOException { BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(Syste.. 2024. 2. 23. [백준] 18295 Ants - Brute Force / Java • 문제 링크 18295번: Ants Charles is fascinated by ants. In order to observe a colony of ants over a long period, Charles managed to build a program that uniquely identifies each ant, using image recognition. (Yes, every ant is unique.) Inside the program, each ant is tagged with a www.acmicpc.net • 풀이 코드 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import.. 2024. 2. 22. [백준] 29994 Investigating Zeroes and Ones - Dynamic Programming / Java • 문제 링크 29994번: Investigating Zeroes and Ones You find yourself in a mysterious binary world, where an array of N binary digits awaits your scrutiny. Each digit is either a zero or a one, creating a unique pattern across the landscape. Your quest is to uncover the hidden patterns of this binary realm www.acmicpc.net • 풀이 코드 import java.io.BufferedWriter; import java.io.IOException; import java.i.. 2024. 2. 21. [백준] 14767 Flow Shop - Dynamic Programming / Java • 문제 링크 14767번: Flow Shop There is only one test case in each file. It begins with a single line containing N and M (1 ≤ N, M ≤ 1000), the number of swathers and stages (respectively). Following this are N lines, each with M integers. The j’th integer of the i’th line is Pi www.acmicpc.net • 풀이 코드 import java.io.BufferedWriter; import java.io.IOException; import java.io.OutputStreamWriter; publi.. 2024. 2. 20. [백준] 7515 Prehistoric Operating Systems - Dynamic Programming / Java • 문제 링크 7515번: Prehistoric Operating Systems It is the year 2254. Ohio Smith is a specialist in dealing with ancient operating systems. For research purposes, he tries to install several operating systems on his computer which were used about 250 years ago. Prior research has yielded the result that www.acmicpc.net • 풀이 코드 import java.io.BufferedWriter; import java.io.IOException; import java.io.. 2024. 2. 19. [백준] 26948 Plankan - Dynamic Programming / Java • 문제 링크 26948번: Plankan Man vill skapa en längre planka med hjälp av ett antal mindre brädor. Det finns tre olika typer av brädor, som har längden $1$, $2$ respektive $3$ meter. Det finns ett obegränsat antal av varje typ. Det finns $7$ sätt att limma ihop en planka som ä www.acmicpc.net • 풀이 코드 import java.io.BufferedWriter; import java.io.IOException; import java.io.OutputStreamWriter; public .. 2024. 2. 18. 이전 1 ··· 110 111 112 113 114 115 116 ··· 223 다음
