questions using dp

Author: kungfucat

COINS-h.cpp

@@ -0,0 +1,34 @@
+#include <stdio.h>
+#include<iostream>
+ 
+using namespace std;
+ 
+long long int a[1000010]={0};
+ 
+long long int max(long long int a,long long int b)
+{
+    if(a>b)
+      return a;
+      return b;
+}
+long long int answer (long long int p)
+{
+   if(p<=1000000)
+     return a[p];
+   else
+     return (answer(p/2)+answer(p/3)+answer(p/4));
+}
+int main() 
+{
+        long long int n;
+        //answer is always gonna be i for such a case
+        for(int i=0;i<=11;i++)
+             a[i]=i;
+        for(int i=12;i<=1000000;i++)
+             a[i]=a[i/2]+a[i/4]+a[i/3];
+     while(cin>>n)
+	{
+		printf("%lld\n",answer(n));
+	}
+	return 0;
+}  

EDIST-h.cpp

@@ -0,0 +1,41 @@
+#include<stdio.h>
+#include<string.h>
+using namespace std;
+int min(int a,int b)
+{
+    if(a>b)
+        return b;
+    else
+        return a;
+}
+int main()
+{
+    int t,len1,len2,i,j,m,temp1,temp2;
+    char str1[2100];
+    char str2[2100];
+    static int a[20001][2001];
+    scanf("%d",&t);
+    while(t--)
+    {
+        scanf("%s",str1);
+        scanf("%s",str2);
+        len1=strlen(str1);
+        len2=strlen(str2);
+        for(i=0;i<=len1;i++)
+            a[i][0]=i;
+        for(i=1;i<=len2;i++)
+            a[0][i]=i;
+        for(i=1;i<=len1;i++)
+        {
+            for(j=1;j<=len2;j++)
+            {
+                m=(str1[i-1]==str2[j-1]) ? 0:1;
+                temp1=min(a[i-1][j]+1,a[i][j-1]+1);
+              temp2=a[i-1][j-1]+m;
+              a[i][j]=min(temp1,temp2);
+            }
+        }
+        printf("%d\n",a[len1][len2]);
+    }
+    return 0;
+} 

KNAPSACK-h.cpp

@@ -0,0 +1,24 @@
+#include<iostream>
+using namespace std;
+ 
+int dp[2005][2005];
+int main(){
+    int s,n,size[2010],values[2010];
+    cin>>s>>n;
+    for(int i=1;i<=n;i++)
+    {
+        cin>>size[i]>>values[i];
+    }
+    for(int i=1;i<=n;i++){
+        for(int j=1;j<=s;j++){
+            if(j < size[i]){
+            dp[i][j]=dp[i-1][j];
+            }
+            else{
+                dp[i][j]=max(values[i]+dp[i-1][j-size[i]],dp[i-1][j]);
+            }
+        }
+    }
+    cout<<dp[n][s];
+    return 0;
+} 

MCOINS-h.cpp

@@ -0,0 +1,26 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+    int k,l,m;
+    bool dp[1000010]={};
+    cin>>k>>l>>m;
+    dp[1]=true;dp[l]=true;dp[k]=true;
+    for(int i=2;i<=1000000;i++){
+        if(i-k>=0 && dp[i-k]==false)
+            dp[i]=true;
+        if(i-1>=0 && dp[i-1]==false)
+            dp[i]=true;
+        if(i-l>=0 && dp[i-l]==false)
+            dp[i]=true;
+    }
+    while(m--){
+        int n;
+        cin>>n;
+        if(dp[n]==true)
+            cout<<"A";
+        else
+            cout<<"B";
+    }
+    return 0;
+}

SUMITR-h.cpp

@@ -0,0 +1,26 @@
+#include<iostream>
+using namespace std;
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        int ans=0,i,n,v[1010][1010],j;
+        cin>>n;
+        for(i=0;i<n;i++){
+            for(j=0;j<i+1;j++)
+                cin>>v[i][j];
+        }
+        for(i=n-2;i>=0;i--){
+            for(j=0;j<i+1;j++){
+                v[i][j]+=max(v[i+1][j],v[i+1][j+1]);
+            }
+        }
+        cout<<v[0][0]<<"\n";
+    }
+    return 0;
+}
+
+/*Submitted code :
+#include<iostream>
+using namespace std;main(){int t;cin>>t;while(t--){int ans=0,i,n,v[110][110],j;cin>>n;for(i=0;i<n;i++){for(j=0;j<i+1;j++)cin>>v[i][j];}for(i=n-2;i>=0;i--){for(j=0;j<i+1;j++){v[i][j]+=max(v[i+1][j],v[i+1][j+1]);}}cout<<v[0][0]<<"\n";}}
+*/

TRT-h.cpp

@@ -0,0 +1,32 @@
+#include<iostream>
+using namespace std;
+
+int dp[2005][2005]={};
+int main(){
+    int i,j,n,arr[2005];
+    long long int cumulative[2005]={};
+    cin>>n;
+    for(i=1;i<=n;i++)
+        cin>>arr[i];
+    for(i=1;i<=n;i++){
+        dp[i][i]=arr[i];
+    }
+    for(i=1;i<=n;i++){
+        cumulative[i]=arr[i]+cumulative[i-1];
+    }
+    for(int range=1;range<=n;range++){
+        for(int be=1;be+range<=n;be++){
+            int en=be+range;
+            int a1=dp[be+1][en] + arr[be] + cumulative[en]-cumulative[be];
+            int a2=dp[be][en-1] + arr[en] + cumulative[en-1]-cumulative[be-1];
+            dp[be][en]=max(a1,a2);
+        }
+    }
+    /*for(i=1;i<=n;i++){
+        for(j=1;j<=n;j++){
+            cout<<dp[i][j]<<" ";
+        }
+        cout<<"\n";
+    }*/
+    cout<<dp[1][n];
+}