Added solutions to 1385-C,1409-B,1409-D

Author: Sindhu-321

Greedy/(CODEFORCES)Decrease_the_sum_of_digits.cpp

@@ -0,0 +1,67 @@
+#include <iostream>
+using namespace std;
+#include <iomanip>
+#include <vector>
+#include <string>
+#include <algorithm>
+#include <unordered_map>
+#include <cmath>
+#include <stack>
+#include <cstdio>
+
+
+
+
+
+
+
+int main() {
+    int t;
+    cin>>t;
+    while(t--){
+    vector<int> a;
+    string s;
+    cin>>s;
+    int ss;
+    cin>>ss;
+    int n=size(s);
+    for(int i=0;i<n;i++){
+        a.push_back(s[i]-'0');
+    }
+    int psum=0;
+    int pri=0;
+    for(int i=0;i<n;i++){
+        psum+=a[i];
+        pri=i;
+        if(psum>=ss){break;}
+    }
+
+    if(pri>=n-1&&psum<=ss)cout<<0<<endl;
+    else if(pri==n-1&&psum==ss){cout<<0<<endl;
+
+    }
+    else{
+        bool su=false;
+        if(psum==ss){
+            int w=pri+1;
+            while(a[w]==0&&w<n)w++;
+            if(w==n){
+                su=true;
+                cout<<0<<endl;
+            }
+        }
+        if(!su){
+        int u=n-1;
+        while(a[u]==0)u--;
+
+        while(a[pri]==9)pri++;
+    for(int i=pri;i<u;i++)cout<<9-a[i];
+    cout<<10-a[u];
+    for(int i=0;i<n-u-1;i++)cout<<0;
+    cout<<endl;
+    }
+    }
+
+    }
+
+}

Greedy/(CODEFORCES)Make_it_good.cpp

@@ -0,0 +1,68 @@
+#include <iostream>
+using namespace std;
+#include <vector>
+int main(){
+    int t;
+    cin>>t;
+    for(int tt=0;tt<t;tt++){
+        int n;
+        cin>>n;
+        vector<int> a(n);
+        for(int i=0;i<n;i++)cin>>a[i];
+        //int maxcount=0;
+        int trend;
+        int j;
+        for(j=n-1;j>0;j--){
+            if(a[j]>a[j-1]){
+                trend=0;
+                break;
+            }
+            else if(a[j]<a[j-1]){
+                trend=1;
+                break;
+            }
+
+
+        }
+        if(j==0){cout<<0<<endl;}
+
+        else{
+            int ans;
+
+         if(trend==0){
+             bool broke=false;
+            for(int k=j-1;k>0;k--){
+                if(a[k]<a[k-1]){
+                    ans=k;
+                    broke=true;
+                    break;
+                }
+
+            }
+            if(!broke){ans=0;}
+            cout<<ans<<endl;
+        }
+        else if(trend==1){
+            bool switched=false;
+            bool broke=false;
+            for(int k=j-1;k>0;k--){
+                if(!switched){
+                    if(a[k]>a[k-1]){switched=true;}
+                }
+                else{
+                    if(a[k]<a[k-1]){
+                        ans=k;
+                        broke=true;
+
+                    }
+                    if(broke){break;}
+                }
+            }
+            if(!switched||!broke){ans=0;}
+            cout<<ans<<endl;
+        }
+
+        }
+
+    }
+}

Greedy/(CODEFORCES)Minimum_product.cpp

@@ -0,0 +1,43 @@
+#include <iostream>
+using namespace std;
+#include <iomanip>
+#include <vector>
+#include <string>
+#include <algorithm>
+#include <unordered_map>
+#include <cmath>
+#include <stack>
+#include <cstdio>
+
+
+
+
+
+
+
+int main() {
+    int t;
+    cin>>t;
+    while(t--){
+    long long int a,b,x,y,n;
+    cin>>a>>b>>x>>y>>n;
+    if(a-x+b-y<=n)cout<<x*y<<endl;
+    else{
+       if(a-x<n&&b-y<n){
+           cout<<min((a-(n-(b-y)))*y,(b-(n-(a-x)))*x)<<endl;
+       }
+       else if(a-x>=n&&b-y<n){
+           cout<<min((y*(a-(n-(b-y)))),(a-n)*b)<<endl;
+
+       }
+       else if(a-x<n&&b-y>=n){
+           cout<<min(x*(b-(n-(a-x))),a*(b-n))<<endl;
+       }
+       else if(a-x>=n&&b-y>=n){
+           cout<<min(a*(b-n),b*(a-n))<<endl;
+       }
+    }
+
+    }
+
+}