Problem Solving1236 [백준] 5938 Daisy Chains in the Field - Graph Theory / Java • 문제 링크 5938번: Daisy Chains in the Field Farmer John let his N (1 2023. 7. 4. [백준] 17199 Milk Factory - Graph Theory / Java • 문제 링크 17199번: Milk Factory The milk business is booming! Farmer John's milk processing factory consists of $N$ processing stations, conveniently numbered $1 \ldots N$ ($1 \leq N \leq 100$), and $N-1$ walkways, each connecting some pair of stations. (Walkways are expensive, so Farmer www.acmicpc.net • 풀이 과정 • 풀이 코드 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOE.. 2023. 7. 3. [백준] 5966 Cow Cotillion - Data Structure / Java • 문제 링크 ") and bulls (shown as " 5966번: Cow Cotillion The cow cotillion, a fancy dance every spring, requires the cows (shown as ">") and bulls (shown as " 2023. 7. 2. [백준] 23568 Find the House - Data Structure / Java • 문제 링크 23568번: Find the House Your program is to read from standard input. The input starts with a line containing an integer $n$ ($1 ≤ n ≤ 10,000$), where $n$ is the number of triples in the list. In the following $n$ lines, $n$ triples are given where each triple is represented a www.acmicpc.net • 풀이 과정 • 풀이 코드 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOExc.. 2023. 7. 1. [백준] 10654 Cow Jog - Data Structure / Java • 문제 링크 10654번: Cow Jog The cows are out exercising their hooves again! There are N cows jogging on an infinitely-long single-lane track (1 = reach) stk.pop(); stk.push(reach); } bw.write(String.valueOf(stk.size())); bw.flush(); } } 2023. 6. 30. [백준] 10657 Cow Jog - Data Structure / Java • 문제 링크 10657번: Cow Jog The cows are out exercising their hooves again! There are N cows jogging on an infinitely-long single-lane track (1 speed) stk.pop(); stk.push(speed); } bw.write(String.valueOf(stk.size())); bw.flush(); } } 2023. 6. 30. 이전 1 ··· 132 133 134 135 136 137 138 ··· 206 다음
