알고리즘 기초 DP 문제 풀이 1

dynamicProgramming/Code_11726.java

@@ -0,0 +1,33 @@
+package dynamicProgramming;
+
+import java.util.Scanner;
+
+/*
+ * �ۼ��� : 2018�� 08�� 03��
+ * �� �� : 2xn Ÿ�ϸ�
+ *     ù° �ٿ� 2��n ũ���� ���簢���� ä��� ����� ���� 10,007�� ���� �������� ����Ѵ�.
+ */
+public class Code_11726 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+
+		int num = sc.nextInt();
+		//dp[i] = 2xn�� �� ����� ��
+
+		dp = new int[num+1];
+		System.out.println(function(num));
+	}
+
+	static int [] dp;
+
+	static int function(int n) {
+		if(n==1||n==0)
+			return 1;
+		if(dp[n]!=0)
+			return dp[n];
+		return dp[n]=(function(n-1)+function(n-2))%10007;
+	}
+
+}

dynamicProgramming/Code_11727.java

@@ -0,0 +1,33 @@
+package dynamicProgramming;
+
+import java.util.Scanner;
+
+/*
+ * �ۼ��� : 2018�� 08�� 03��
+ * �� �� : 2xn Ÿ�ϸ�2
+ *     ù° �ٿ� 2��n ũ���� ���簢���� ä��� ����� ���� 10,007�� ���� �������� ����Ѵ�.
+ */
+public class Code_11727 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+
+		int num = sc.nextInt();
+		//dp[i] = 2xn�� �� ����� ��
+
+		dp = new int[num+1];
+		System.out.println(function(num));
+	}
+
+	static int [] dp;
+
+	static int function(int n) {
+		if(n==1||n==0)
+			return 1;
+		if(dp[n]!=0)
+			return dp[n];
+		return dp[n]=(function(n-1)+2*function(n-2))%10007;
+	}
+
+}

dynamicProgramming/Code_1463.java

@@ -0,0 +1,50 @@
+package dynamicProgramming;
+
+import java.util.Scanner;
+
+/*
+ * �ۼ��� : 2018�� 08�� 03��
+ * �� �� : 1�� �����
+ *      ù° �ٿ� ������ �ϴ� Ƚ���� �ּҰ��� ����Ѵ�.
+ */
+public class Code_1463 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+
+		int num = sc.nextInt();
+		dp = new int[num+1];
+		//dp[i] = i�� 1�� ����µ� �ʿ��� �ּ� Ƚ��
+		System.out.println(minCount(num));
+
+
+	}
+
+	public static int[] dp;
+
+	static int minCount(int num) {
+
+		int x;
+
+		if(num==1)
+			return 0;
+		if(dp[num]!=0)
+			return dp[num];
+
+		int min = minCount(num-1)+1;
+
+		if(num%3==0) {
+			x = minCount(num/3)+1;
+			if(min>x)
+				min = x;
+		}
+		if(num%2==0) {
+			x = minCount(num/2)+1;
+			if(min>x)
+				min = x;
+		}
+	//	System.out.println("num = "+num+" min = "+min);
+		return dp[num]=min;
+	}
+}

dynamicProgramming/Code_9095.java

@@ -0,0 +1,41 @@
+package dynamicProgramming;
+
+import java.util.Scanner;
+
+/*
+ * �ۼ��� : 2018�� 08�� 03��
+ * �� �� : 1,2,3 ���ϱ�
+ *     �� �׽�Ʈ ���̽�����, n�� 1,2,3�� ������ ��Ÿ���� ����� ���� ����Ѵ�.
+ */
+public class Code_9095 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner sc = new Scanner(System.in);
+
+		int num = sc.nextInt();
+		//dp[n] = n�� 1,2,3�� �������� ��Ÿ���� ����Ǽ�
+		while(num-->0) {
+		int n = sc.nextInt();
+		dp = new int[n+1];
+		System.out.println(function(n));
+		}
+	}
+	static int [] dp;
+
+	static int function(int n) {
+		int sum=0;
+		if(n==1 || n==0)
+			return 1;
+		if(dp[n]!=0)
+			return dp[n];
+		if(n>1)
+			sum+=function(n-1);
+		if(n>=2)
+			sum+=function(n-2);
+		if(n>=3)
+			sum+=function(n-3);
+
+		return dp[n]=sum;
+	}
+}