- 생각
모든 국가를 지나도록 이용할 수 있는 최소의 비행기의 개수는 국가의 수-1
- 코드
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
public class Main {
static StringBuilder sb;
public static void main(String[] args) throws Exception {
SetData();
}
// 데이터
private static void SetData() throws Exception {
InputReader in = new InputReader(System.in);
PrintWriter out = new PrintWriter(System.out);
int num = in.nextInt();
sb = new StringBuilder();
for (int i = 0; i < num; i++) {
Solve(in, out);
}
out.print(sb);
out.close();
}
private static void Solve(InputReader in, PrintWriter out) {
int country = in.nextInt();
int plane = in.nextInt();
for (int j = 0; j < plane; j++) {
in.nextInt();
in.nextInt();
}
sb.append(country - 1 + "\n");
}
}
class InputReader {
private final InputStream stream;
private final byte[] buf = new byte[8192];
private int curChar, snumChars;
public InputReader(InputStream st) {
this.stream = st;
}
public int read() {
if (snumChars == -1)
throw new InputMismatchException();
if (curChar >= snumChars) {
curChar = 0;
try {
snumChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (snumChars <= 0)
return -1;
}
return buf[curChar++];
}
public int nextInt() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public long nextLong() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
long res = 0;
do {
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public int[] nextIntArray(int n) {
int a[] = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
public String readString() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isSpaceChar(c));
return res.toString();
}
public String nextLine() {
int c = read();
while (isSpaceChar(c))
c = read();
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isEndOfLine(c));
return res.toString();
}
public boolean isSpaceChar(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
private boolean isEndOfLine(int c) {
return c == '\n' || c == '\r' || c == -1;
}
}
'algorithm' 카테고리의 다른 글
[BOJ/JAVA] 백준 9461번 : 파도반 수열 (0) | 2021.01.29 |
---|---|
[BOJ/JAVA] 백준 15886번 : 내 선물을 받아줘 2 (0) | 2021.01.29 |
[BOJ/JAVA] 백준 2470번 : 두 용액 (0) | 2021.01.28 |
[BOJ/JAVA] 백준 2178번 : 미로 탐색 (0) | 2021.01.27 |
[BOJ/JAVA] 백준 1520번 : 내리막 길 (0) | 2021.01.27 |