12/04/2021, 22:10:11

Author: kumar80

189a.cpp

@@ -71,9 +71,17 @@ int main(){
     fastio;
     int t=1;// cin>>t;
     while(t--){
-        string s; cin>>s;
-        if(s[0]==s[1] && s[1]==s[2] && isupper(s[0]) && isupper(s[1]) && isupper(s[2])) 
-            cout<<"Won";
-        else cout<< "Lost";
+        int n; cin>>n;
+        int a[n];
+        FOR(i,0,n) cin>>a[i];
+        int ans  = 0;
+        FOR(i,0,n) {
+          int mn = a[i];
+          FOR(j,i,n) {
+            mn = min(mn,a[j]);
+            ans = max(ans, (j-i+1)*mn);
+          }
+        }
+        cout<<ans;
     }
 }

690c.cpp

@@ -67,32 +67,33 @@ using namespace std;
 
 const long long INF = 1e18;
 const long long MAX = 2e5+10;
-int ans = INT_MAX;
-void f(int n, vector<bool>d,int v,int sum){
-    if(sum>n) return;
-    
-    if(sum==n) {
-      ans = min(ans,v);
-      return;
-    }
-    FOR(i,1,10){
-        if(!d[i]) {
-          vector<bool>temp=d;
-          temp[i]=true;
-          f(n,temp,v*10+i,sum+i);
-        }
-    }
-   
-}
+
 int main(){
     fastio;
     int t=1; cin>>t;
     while(t--){
           int n; cin>>n;
-          vector<bool>d(10,false);
-          ans = INT_MAX;
-          f(n,d,0,0);
-          if(ans==INT_MAX) cout<<-1<<"\n";
-          else cout<<ans<<"\n";
+          string ans;
+          bool pos = true;
+          int j=9;
+          while(n>0){
+             ROF(i,j,1){
+               if(n>=i){
+                ans.push_back('0'+i);
+                n-=i;
+                j=i-1;
+                break;
+              }
+             }
+
+            if(j==0 && n) {
+              
+              pos=false; break;
+            }
+          }
+          
+          reverse(ans.begin(),ans.end());
+          if(!pos) ans = "-1";
+          cout<<ans<<endl;
     }
 }

DE.cpp

@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define FOR(i, j, k) for (auto i=j ; i<k ; i++)
+
+void f( int t, vector<string>arr){
+    int k=0;
+    int ans = 0;
+    // while(k<t){
+    //     k++;
+    //     string s=arr[k];
+    //     vector<int>v(30,0);
+    //     int n = s.size();
+        
+    //     FOR(i,0,n){
+    //         v[s[i]-'a']++;
+    //     }
+    //     int o=0,e=0;
+    //     FOR(i,0,26){
+    //         if(v[i]&1) o++;
+    //         else e++;
+    //     }
+    //     if(n&1){
+    //         if(o==1|| o==3) ans++;
+    //     }
+    //     else {
+    //         if(o==2) ans++;   
+    //     }
+    // }
+    cout<< ans;
+}
+int main() {
+    int t; cin>>t; vector<string>v(t);
+    FOR(i,0,t) cin>>v[i];
+    f(t,v);
+}

DE2.cpp

@@ -0,0 +1,37 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define FOR(i, j, k) for (auto i=j ; i<k ; i++)
+int n, m, k;
+int dp[71][71][71][71];
+int ns[71][71];
+int cur;
+int solve(int row, int col, int mod, int rem){
+
+    if(col==m){
+        return solve(row+1, 0, mod, m/2);
+    }
+
+    if(row==n){
+        if(mod==0) return 0;
+        return -1e9;
+    }
+
+    int &ret=dp[row][col][mod][rem];
+    if(ret != -1) return ret;
+    ret=solve(row, col+1, mod, rem);
+    if(rem) ret=max(ret, ns[row][col]+solve(row, col+1, (mod+ns[row][col])%k, rem-1));
+
+    return ret;
+
+}
+
+int main(){
+    cin >> n >> m >> k;
+    FOR(i,0,n) FOR(j,0,m) cin >> ns[i][j];
+    memset(dp, -1, sizeof dp);
+    int ans=0;
+    ans = solve(0, 0, 0, m/2);
+    cout << ans << "\n";
+    return 0;
+}

__pycache__/day.cpython-38.pyc

@@ -0,0 +1,81 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+#define FOR(i, j, k) for (auto i = j; i < k; i++)
+
+class Graph
+{
+    int V;
+    int ans = 0;
+    list<int> *adj;
+
+    void DFSUtil(int v, bool visited[]);
+
+public:
+    Graph(int V);
+    ~Graph();
+    void addEdge(int v, int w);
+    int connectedComponents();
+};
+
+int Graph::connectedComponents()
+{
+    bool *visited = new bool[V];
+    for (int v = 0; v < V; v++)
+        visited[v] = false;
+
+    for (int v = 0; v < V; v++)
+    {
+        if (visited[v] == false)
+        {
+            DFSUtil(v, visited);
+            ans++;
+        }
+    }
+    delete[] visited;
+    return ans;
+}
+
+void Graph::DFSUtil(int v, bool visited[])
+{
+    visited[v] = true;
+
+    list<int>::iterator i;
+    for (i = adj[v].begin(); i != adj[v].end(); ++i)
+        if (!visited[*i])
+            DFSUtil(*i, visited);
+}
+
+Graph::Graph(int V)
+{
+    this->V = V;
+    adj = new list<int>[V];
+}
+
+Graph::~Graph() { delete[] adj; }
+
+void Graph::addEdge(int v, int w)
+{
+    adj[v].push_back(w);
+    adj[w].push_back(v);
+}
+
+int main()
+{
+    int n;
+    cin >> n;
+    Graph g(n);
+
+    FOR(i, 0, n)
+    FOR(j, 0, n)
+    {
+        int x;
+        cin >> x;
+        if (x == 1)
+        {
+            g.addEdge(i, j);
+        }
+    }
+    cout << g.connectedComponents();
+    return 0;
+}

a.out

@@ -0,0 +1,39 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define FOR(i, j, k) for (auto i = j; i < k; i++)
+
+int main() {
+    int n,k; cin>>n>>k;
+    map<int,int>mp;
+    vector<int>mx(n+1,0);
+    vector<int>adj[n+1];
+    vector<int>vis(n+1,0);
+    queue<int>q;
+    FOR(i,0,k) {
+        int p; cin>>p;
+        mp[p]=1;
+    }
+    FOR(i,0,n-1){
+        int u,v; cin>>u>>v;
+        adj[u].push_back(v);
+        adj[v].push_back(u);
+    }
+    if(mp[n]) mx[n]=1;
+    q.push(n);
+    while(!q.empty()){
+        int u = q.front();
+        q.pop(); vis[u]=1;
+        FOR(i,0,adj[u].size()) {
+            int v= adj[u][i];
+            if(!vis[v]) {
+                if(mp[v])
+                mx[v] = 1 + mx[u];
+                else mx[v]  = mx[u];
+                q.push(v);
+            }
+        }
+    }
+    int ans = 0;
+    FOR(i,0,n+1) ans = max(ans,mx[i]);
+    cout<<ans;
+}

cap.cpp

@@ -0,0 +1,50 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define FOR(i, j, k) for (auto i = j; i < k; i++)
+#define time__(d) for (long blockTime = 0; (blockTime == 0 ? (blockTime = clock()) != 0 : false); debug("%s time : %.4fs", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
+#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
+
+int main()
+{
+    int m;
+    cin >> m;
+    int ans = 0;
+    time__("code")
+    {
+        FOR(i, 1, m)
+        {
+            int f = i, s = m - i;
+            set<int> a; a.insert(1); a.insert(f);
+            for (int j = 2; j * j <= f; j++)
+            {
+                if (f % j == 0)
+                {
+                    if (j * j == f)
+                        a.insert(j);
+                    else
+                        a.insert(j), a.insert(f / j);
+                }
+            }
+            ans+=distance(a.begin(),a.lower_bound(s));
+            
+            for (int j = 2; j * j <= s; j++)
+            {
+                if (s % j == 0)
+                {
+                    if (j * j == s)
+                    {
+                        auto it = a.lower_bound(j);
+                        ans += distance(a.begin(), it);
+                    }
+                    else
+                    {
+                        auto it = a.lower_bound(j);
+                        auto it2 = a.lower_bound(s / j);
+                        ans += distance(a.begin(), it) + distance(a.begin(), it2);
+                    }
+                }
+            }
+        }
+    }
+    cout << ans;
+}