commit on 13 august 2023

Author: dotexe3301

Diff for: .vscode/settings.json

@@ -1,6 +1,8 @@
 {
     "files.associations": {
         "iostream": "cpp",
-        "unordered_map": "cpp"
+        "unordered_map": "cpp",
+        "ostream": "cpp",
+        "cmath": "cpp"
     }
 }

Diff for: 0001A_theatre_square.cpp

@@ -0,0 +1,29 @@
+#include<iostream>
+#include<algorithm>
+#include<array>
+#include<vector>
+#include<map>
+#include<cmath>
+using namespace std;
+int main()
+{
+     long double a, n, m, temp;
+    
+    cout.precision(22);     // acc to testcases
+    cin >> n >> m >> a;
+    if(m < n)
+    {
+        temp = m;
+        m = n;
+        n = temp;
+    }
+   
+    if(a >= m)
+    {
+        cout << ceil(n/a) << endl;
+    }
+    else
+    {
+        cout << ceil(m/a)*ceil(n/a) << endl;
+    }
+}

Diff for: 0004A_watermelon.cpp

@@ -0,0 +1,17 @@
+#include<iostream>
+#include<algorithm>
+#include<array>
+#include<vector>
+#include<map>
+#include<cmath>
+using namespace std;
+int main()
+{
+    int n;
+    cin>>n;
+    if(n%2==0 && n>2)
+        cout<<"YES"<<endl;
+    else
+        cout<<"NO"<<endl;
+    return 0;
+}

Diff for: 0050A_domino_piling.cpp

@@ -0,0 +1,19 @@
+#include<iostream>
+#include<algorithm>
+#include<array>
+#include<vector>
+#include<map>
+#include<cmath>
+using namespace std;
+int main()
+{
+    int m,n;
+    cin>>m>>n;
+    if(m*n<2)
+    {
+        cout<<"0"<<endl;
+        return 0;
+    }
+    cout<<floor((m*n)/2)<<endl;
+    return 0;
+}

Diff for: 0071A_way_too_long_words.cpp

@@ -0,0 +1,28 @@
+#include<iostream>
+#include<algorithm>
+#include<string>
+#include<array>
+#include<vector>
+#include<map>
+#include<cmath>
+using namespace std;
+int main()
+{
+    long t;
+    cin>>t;
+    while(t--)
+    {
+        string word;
+        cin>>word;
+        if(word.size()>10)
+        {
+            int len = word.size();
+            cout<<word[0]<<len-2<<word[len-1]<<endl;
+        }
+        else
+        {
+            cout<<word<<endl;
+        }
+    }
+    return 0;
+}

Diff for: 0158A_next_round.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <algorithm>
+#include <array>
+#include <vector>
+#include <map>
+#include <cmath>
+using namespace std;
+int main()
+{
+    int n, k;
+    cin >> n >> k;
+    int a;
+    for (int i = 0; i < k; ++i)
+    {
+        cin >> a;
+        if (a == 0)
+        {
+            cout << i << endl;
+            return 0;
+        }
+    }
+
+    int b;
+    for (int i = k; i < n; ++i)
+    {
+        cin >> b;
+        if (b != a)
+        {
+            cout << i << endl;
+            return 0;
+        }
+    }
+
+    cout << n << endl;
+    return 0;
+}

Diff for: 0231A_team.cpp

@@ -0,0 +1,22 @@
+#include<iostream>
+#include<algorithm>
+#include<array>
+#include<vector>
+#include<map>
+#include<cmath>
+using namespace std;
+int main()
+{
+    long t;
+    cin>>t;
+    int count=0;
+    while(t--)
+    {
+        int a,b,c;
+        cin>>a>>b>>c;
+        if((a+b+c)>=2)
+            count++;
+    }
+    cout<<count<<endl;
+    return 0;
+}

Diff for: 890_contest.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+std::vector<std::vector<int>> adj_list;
+std::vector<int> subtree_size;
+
+int dfs(int u, int parent) {
+    int count = 0;
+    for (int v : adj_list[u]) {
+        if (v != parent) {
+            count += dfs(v, u) + subtree_size[v];
+        }
+    }
+    subtree_size[u] = count;
+    return count;
+}
+
+int findMaxFValue(int n) {
+    adj_list.resize(n + 1);
+    subtree_size.assign(n + 1, 0);
+
+    // Read the tree edges
+    for (int i = 2; i <= n; i++) {
+        int p;
+        std::cin >> p;
+        adj_list[p].push_back(i);
+    }
+
+    dfs(1, 0);
+
+    int max_f_value = 0;
+    for (int u = 1; u <= n; u++) {
+        int f_value = 0;
+        for (int v : adj_list[u]) {
+            f_value = std::max(f_value, subtree_size[v]);
+        }
+        f_value += (n - subtree_size[u] - 1);
+        max_f_value = std::max(max_f_value, f_value);
+    }
+
+    return max_f_value;
+}
+
+int main() {
+    int n;
+    std::cin >> n;
+
+    int result = findMaxFValue(n);
+    std::cout << result << std::endl;
+
+    return 0;
+}

Diff for: 892_contest.cpp

@@ -0,0 +1,64 @@
+#include <iostream>
+#include <algorithm>
+#include <array>
+#include <vector>
+#include <map>
+#include <cmath>
+using namespace std;
+int main()
+{
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        int n;
+        cin >> n;
+
+        vector<int> a(n, 0);
+        for (int i = 0; i < n; i++)
+        {
+            cin >> a[i];
+        }
+
+        sort(a.begin(), a.end());
+
+        vector<int> b, c;
+
+        // Separate elements into b and c
+        b.push_back(a[0]);
+        for (int i = 1; i < n; i++)
+        {
+            for (int j = 0; j < b.size(); j++)
+            {
+                if (b[j] % a[i] == 0)
+                {
+                    b.push_back(a[i]);
+                }
+                else
+                {
+                    c.push_back(a[i]);
+                }
+            }
+        }
+
+        if (c.size()==0)
+        {
+            cout << "-1" << endl;
+        }
+        else
+        {
+            cout << b.size() << " " << c.size() << endl;
+            for (int num : b)
+            {
+                cout << num << " ";
+            }
+            cout << endl;
+            for (int num : c)
+            {
+                cout << num << " ";
+            }
+            cout << endl;
+        }
+    }
+    return 0;
+}