1031

djs02027 · djs02027 · commit b870d0649e94 · 2022-11-01T00:27:39.000+09:00
diff --git a/.idea/modules.xml b/.idea/modules.xml
diff --git a/BOJ/gold/BOJ1107/src/Main.java b/BOJ/gold/BOJ1107/src/Main.java
@@ -1,39 +1,34 @@
-import java.io.BufferedReader;
-import java.io.IOException;
-import java.io.InputStreamReader;
-import java.util.Arrays;
-import java.util.StringTokenizer;
 
+import java.util.Scanner;
 import static java.lang.Math.abs;
 
 public class Main {
     static int now = 100;
-    public static void main(String[] args) throws IOException {
-        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
-        String N= br.readLine();
-        String [] target = N.split("");
-        int M = Integer.parseInt(br.readLine());
+    public static void main(String[] args)  {
+        Scanner sc = new Scanner(System.in);
+        String N= sc.next();
+        int target=Integer.parseInt(N);
+        int M = sc.nextInt();
         int [] breakButton = new int[10];
-        StringTokenizer st = new StringTokenizer(br.readLine());
         for (int i = 0; i < M; i++) {
-            int button=Integer.parseInt(st.nextToken());
+            int button=sc.nextInt();
             breakButton[button]=1;
         }
-        int cnt =abs(Integer.parseInt(N)-now);
-        int len = target.length;
+        int cnt =abs(target-now);
         //최대값은 문제에서 500000이라고 되어있으나 리모콘이 9를 제외하고 모두 고장났다면
         // 999999를 눌러서 찾는 경우도 포함되어야 하므로 최대값을 999999으로 설정한다
         for (int i = 0; i <=999999; i++) {
-            String [] NowNum = String.valueOf(i).split("");
+            String NowNum = String.valueOf(i);
+            int len=NowNum.length();
             boolean check =false;
-            for (int j = 0; j < NowNum.length; j++) {
-                if(breakButton[Integer.parseInt(NowNum[j])]==1){
+            for (int j = 0; j < len; j++) {
+                if(breakButton[NowNum.charAt(j)-'0']==1){
                     check=true;
                     break;
                 }
             }
             if(!check){
-                int min= abs(Integer.parseInt(N)-i)+NowNum.length;
+                int min= abs(target-i)+len;
                 cnt=Math.min(cnt,min);
             }
         }
diff --git a/BOJ/silver/BOJ9095/BOJ9095.iml b/BOJ/silver/BOJ9095/BOJ9095.iml
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
diff --git a/BOJ/silver/BOJ9095/src/Main.java b/BOJ/silver/BOJ9095/src/Main.java
@@ -0,0 +1,24 @@
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class Main {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int T =sc.nextInt();
+        int [] dp = new int[12];
+        dp[0]=1;
+        dp[1]=1;
+        dp[2]=2;
+        for (int i = 3; i <12 ; i++) {
+
+            dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
+
+
+        }
+
+        for (int i = 0; i < T; i++) {
+            int n = sc.nextInt();
+            System.out.println(dp[n]);
+        }
+    }
+}
