add all files

Author: kimhm0728

baekjoon/.classpath .classpath

@@ -1,6 +1,6 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<classpath>
-	<classpathentry kind="src" path="src"/>
-	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-11"/>
-	<classpathentry kind="output" path="bin"/>
-</classpath>
+<?xml version="1.0" encoding="UTF-8"?>
+<classpath>
+	<classpathentry kind="src" path="src"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-11"/>
+	<classpathentry kind="output" path="bin"/>
+</classpath>

baekjoon/.gitignore .gitignore

@@ -1,17 +1,17 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<projectDescription>
-	<name>baekjoon</name>
-	<comment></comment>
-	<projects>
-	</projects>
-	<buildSpec>
-		<buildCommand>
-			<name>org.eclipse.jdt.core.javabuilder</name>
-			<arguments>
-			</arguments>
-		</buildCommand>
-	</buildSpec>
-	<natures>
-		<nature>org.eclipse.jdt.core.javanature</nature>
-	</natures>
-</projectDescription>
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>baekjoon</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.eclipse.jdt.core.javabuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.eclipse.jdt.core.javanature</nature>
+	</natures>
+</projectDescription>

.idea/.gitignore

@@ -1,14 +1,14 @@
-eclipse.preferences.version=1
-org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
-org.eclipse.jdt.core.compiler.codegen.targetPlatform=11
-org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
-org.eclipse.jdt.core.compiler.compliance=11
-org.eclipse.jdt.core.compiler.debug.lineNumber=generate
-org.eclipse.jdt.core.compiler.debug.localVariable=generate
-org.eclipse.jdt.core.compiler.debug.sourceFile=generate
-org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
-org.eclipse.jdt.core.compiler.problem.enablePreviewFeatures=disabled
-org.eclipse.jdt.core.compiler.problem.enumIdentifier=error
-org.eclipse.jdt.core.compiler.problem.reportPreviewFeatures=warning
-org.eclipse.jdt.core.compiler.release=enabled
-org.eclipse.jdt.core.compiler.source=11
+eclipse.preferences.version=1
+org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
+org.eclipse.jdt.core.compiler.codegen.targetPlatform=11
+org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
+org.eclipse.jdt.core.compiler.compliance=11
+org.eclipse.jdt.core.compiler.debug.lineNumber=generate
+org.eclipse.jdt.core.compiler.debug.localVariable=generate
+org.eclipse.jdt.core.compiler.debug.sourceFile=generate
+org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
+org.eclipse.jdt.core.compiler.problem.enablePreviewFeatures=disabled
+org.eclipse.jdt.core.compiler.problem.enumIdentifier=error
+org.eclipse.jdt.core.compiler.problem.reportPreviewFeatures=warning
+org.eclipse.jdt.core.compiler.release=enabled
+org.eclipse.jdt.core.compiler.source=11

.idea/BOJ-Java.iml

@@ -0,0 +1,12 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager">
+    <output url="file://$MODULE_DIR$/bin" />
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="jdk" jdkName="Java-17" jdkType="JavaSDK" />
+  </component>
+</module>

.idea/misc.xml

@@ -1,27 +1,27 @@
-package baekjoon;
-import java.io.BufferedReader;
-import java.io.IOException;
-import java.io.InputStreamReader;
-
-public class B_1003 {
-	static int[][] fib = new int[41][2];
-	public static void main(String[] args) throws IOException {
-		fib[0][0] = 1; // fibo(0)ÀÏ ¶§ 0 È£Ãâ Ƚ¼ö
-		fib[0][1] = 0;
-		fib[1][0] = 0;
-		fib[1][1] = 1; 
-		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
-		StringBuilder sb = new StringBuilder();
-		int T = Integer.parseInt(br.readLine());
-
-		for(int i=2;i<41;i++) {
-			fib[i][0] = fib[i-1][0] + fib[i-2][0];
-			fib[i][1] = fib[i-1][1] + fib[i-2][1];
-		}
-		for(int i=0;i<T;i++) {
-			int n = Integer.parseInt(br.readLine());
-			sb.append(fib[n][0] + " " + fib[n][1] + "\n");
-		}
-		System.out.println(sb);
-	}
+package baekjoon;
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+
+public class B_1003 {
+	static int[][] fib = new int[41][2];
+	public static void main(String[] args) throws IOException {
+		fib[0][0] = 1; // fibo(0)ÀÏ ¶§ 0 È£Ãâ Ƚ¼ö
+		fib[0][1] = 0;
+		fib[1][0] = 0;
+		fib[1][1] = 1; 
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		StringBuilder sb = new StringBuilder();
+		int T = Integer.parseInt(br.readLine());
+
+		for(int i=2;i<41;i++) {
+			fib[i][0] = fib[i-1][0] + fib[i-2][0];
+			fib[i][1] = fib[i-1][1] + fib[i-2][1];
+		}
+		for(int i=0;i<T;i++) {
+			int n = Integer.parseInt(br.readLine());
+			sb.append(fib[n][0] + " " + fib[n][1] + "\n");
+		}
+		System.out.println(sb);
+	}
 }

.idea/modules.xml

@@ -1,37 +1,37 @@
-package baekjoon;
-import java.io.*;
-import java.util.Arrays;
-
-// 재귀로 푸는 방법
-public class B_1003_1 {
-	static int[][] fibo = new int[41][2];
-	static StringBuilder sb;
-	public static void main(String[] args) throws IOException {
-		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
-		int T = Integer.parseInt(br.readLine());
-		sb = new StringBuilder();
-		
-		for(int i=0;i<41;i++)
-			Arrays.fill(fibo[i], -1);
-		// 비어있는 경우 -1 값을 가짐
-		
-		fibo[0][0] = 1;
-		fibo[0][1] = 0;
-		fibo[1][0] = 0;
-		fibo[1][1] = 1;
-		
-		for(int i=0;i<T;i++) {
-			int n = Integer.parseInt(br.readLine());
-			fib(n);
-			sb.append(fibo[n][0]+" "+fibo[n][1]+"\n");
-		}
-		System.out.println(sb);
-	}
-	static int[] fib(int n) {
-		if(fibo[n][0] == -1 || fibo[n][1] == -1) {
-			fibo[n][0] = fib(n-1)[0] + fib(n-2)[0];
-			fibo[n][1] = fib(n-1)[1] + fib(n-2)[1];
-		}
-		return fibo[n];
-	}
-}
+package baekjoon;
+import java.io.*;
+import java.util.Arrays;
+
+// 재귀로 푸는 방법
+public class B_1003_1 {
+	static int[][] fibo = new int[41][2];
+	static StringBuilder sb;
+	public static void main(String[] args) throws IOException {
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		int T = Integer.parseInt(br.readLine());
+		sb = new StringBuilder();
+		
+		for(int i=0;i<41;i++)
+			Arrays.fill(fibo[i], -1);
+		// 비어있는 경우 -1 값을 가짐
+		
+		fibo[0][0] = 1;
+		fibo[0][1] = 0;
+		fibo[1][0] = 0;
+		fibo[1][1] = 1;
+		
+		for(int i=0;i<T;i++) {
+			int n = Integer.parseInt(br.readLine());
+			fib(n);
+			sb.append(fibo[n][0]+" "+fibo[n][1]+"\n");
+		}
+		System.out.println(sb);
+	}
+	static int[] fib(int n) {
+		if(fibo[n][0] == -1 || fibo[n][1] == -1) {
+			fibo[n][0] = fib(n-1)[0] + fib(n-2)[0];
+			fibo[n][1] = fib(n-1)[1] + fib(n-2)[1];
+		}
+		return fibo[n];
+	}
+}

.idea/workspace.xml

@@ -1,33 +1,33 @@
-package baekjoon;
-import java.util.*;
-
-public class B_1010_1 {
-	public static void main(String[] args) {
-		Scanner stdin = new Scanner(System.in);
-		int n = stdin.nextInt();
-		for(int i=0;i<n;i++) {
-			double N = stdin.nextDouble();
-			double M = stdin.nextDouble();
-			System.out.printf("%.0f\n", combination(M, N));
-		}
-		stdin.close();
-	}
-	public static double factorial(double a) { // a!
-		double n = 1;
-		for(double i=1;i<=a;i++)
-			n *= i;
-		return n;
-	}
-	public static double permutation(double a, double b) { // aPb
-		double n = 1;
-		double c = a - b + 1; // a부터 c까지 b개의 숫자를 곱함
-		for(double i=a;i>=c;i--)
-			n *= i;
-		return n;
-	}
-	
-	public static double combination(double a, double b) { // aCb
-		return permutation(a, b) / factorial(b);
-		// permutation(a, b) / permutation(b, b) 로 대체하여 factorial 함수 없이도 구현 가능
-	}
+package baekjoon;
+import java.util.*;
+
+public class B_1010_1 {
+	public static void main(String[] args) {
+		Scanner stdin = new Scanner(System.in);
+		int n = stdin.nextInt();
+		for(int i=0;i<n;i++) {
+			double N = stdin.nextDouble();
+			double M = stdin.nextDouble();
+			System.out.printf("%.0f\n", combination(M, N));
+		}
+		stdin.close();
+	}
+	public static double factorial(double a) { // a!
+		double n = 1;
+		for(double i=1;i<=a;i++)
+			n *= i;
+		return n;
+	}
+	public static double permutation(double a, double b) { // aPb
+		double n = 1;
+		double c = a - b + 1; // a부터 c까지 b개의 숫자를 곱함
+		for(double i=a;i>=c;i--)
+			n *= i;
+		return n;
+	}
+	
+	public static double combination(double a, double b) { // aCb
+		return permutation(a, b) / factorial(b);
+		// permutation(a, b) / permutation(b, b) 로 대체하여 factorial 함수 없이도 구현 가능
+	}
 }

baekjoon/.project .project

@@ -1,33 +1,33 @@
-package baekjoon;
-import java.io.*;
-import java.util.*;
-
-public class B_1010_2 {
-	static int[][] dp = new int[30][30];
-	public static void main(String[] args) throws IOException {
-		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
-		int T = Integer.parseInt(br.readLine());
-		
-		StringTokenizer st;
-		StringBuilder sb = new StringBuilder();
-		for(int i=0;i<T;i++) {
-			st = new StringTokenizer(br.readLine());
-			
-			int N = Integer.parseInt(st.nextToken());
-			int M = Integer.parseInt(st.nextToken());
-			
-			sb.append(combi(M, N)).append("\n");
-		}
-		System.out.println(sb);
-	}
-	static int combi(int a, int b) { // aCb
-		if(dp[a][b] > 0) // 값이 이미 계산된 경우 그 값을 반환
-			return dp[a][b]; 
-		
-		if (a == b || b == 0)
-			return dp[a][b] = 1;
-		
-		return dp[a][b] = combi(a - 1, b - 1) + combi(a - 1, b);
-		// 조합의 성질을 이용하지 않고 팩토리얼로 풀면 값의 범위가 너무 커 BigInteger 클래스나 double 자료형을 사용해야 함.
-	} 
+package baekjoon;
+import java.io.*;
+import java.util.*;
+
+public class B_1010_2 {
+	static int[][] dp = new int[30][30];
+	public static void main(String[] args) throws IOException {
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		int T = Integer.parseInt(br.readLine());
+		
+		StringTokenizer st;
+		StringBuilder sb = new StringBuilder();
+		for(int i=0;i<T;i++) {
+			st = new StringTokenizer(br.readLine());
+			
+			int N = Integer.parseInt(st.nextToken());
+			int M = Integer.parseInt(st.nextToken());
+			
+			sb.append(combi(M, N)).append("\n");
+		}
+		System.out.println(sb);
+	}
+	static int combi(int a, int b) { // aCb
+		if(dp[a][b] > 0) // 값이 이미 계산된 경우 그 값을 반환
+			return dp[a][b]; 
+		
+		if (a == b || b == 0)
+			return dp[a][b] = 1;
+		
+		return dp[a][b] = combi(a - 1, b - 1) + combi(a - 1, b);
+		// 조합의 성질을 이용하지 않고 팩토리얼로 풀면 값의 범위가 너무 커 BigInteger 클래스나 double 자료형을 사용해야 함.
+	} 
 }