Patch 6

APlusB.cpp

@@ -0,0 +1,14 @@
+#include <iostream>
+int a=2;
+int sum_of_two_digits(int first_digit, int second_digit) {
+    return first_digit + second_digit;
+}
+
+int main() {
+    int a = 0;
+    int b = 0;
+    std::cin >> a;
+    std::cin >> b;
+    std::cout << sum_of_two_digits(a, b);
+    return 0;
+}

AboutMe.md

@@ -0,0 +1,2 @@
+I am Varun Sharma.
+I am Excel Blaze.

DIV2A.cpp

@@ -0,0 +1,75 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main()
+{
+    int n;
+    cin>>n;
+
+    int a[n];
+
+    int flag=0;
+
+    for(int i=0;i<n;i++)
+    {
+        cin>>a[i];
+        if(a[i]>=0)
+        {
+            a[i]=-a[i]-1;
+            if(a[i]!=-1)
+            flag=1;
+        }
+    }
+
+
+    if(flag==1)
+    {
+        if(n%2==0)
+        {
+            for(int i=0;i<n;i++)
+            {
+                cout<<a[i]<<" ";
+            }
+        }
+        else
+        {
+            vector<int> v;
+            for(int i=0;i<n;i++)
+            {
+                if(a[i]!=-1)
+                v.push_back(a[i]);
+
+            }
+
+            sort(v.begin(),v.end());
+            int last=v[v.size()-1];
+            int g=0;
+            for(int i=0;i<n;i++)
+            {
+                if(a[i]==last&&g==0)
+                {
+                    a[i]=-a[i]-1;
+                    g=1;
+                }
+
+                cout<<a[i]<<" ";
+            }
+        }
+
+    }
+    else
+    {
+        if(n%2==0)
+        {
+            for(int i=0;i<n;i++)
+            cout<<a[i]<<" ";
+        }
+        else
+        {
+            cout<<0<<" ";
+            for(int i=1;i<n;i++)
+            cout<<a[i]<<" ";
+        }
+    }
+}

DIV2B.cpp

@@ -0,0 +1,75 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main()
+{
+    int n;
+    cin>>n;
+
+    int a[n];
+
+    int flag=0;
+
+    for(int i=0;i<n;i++)
+    {
+        cin>>a[i];
+        if(a[i]>=0)
+        {
+            a[i]=-a[i]-1;
+            if(a[i]!=-1)
+            flag=1;
+        }
+    }
+
+
+    if(flag==1)
+    {
+        if(n%2==0)
+        {
+            for(int i=0;i<n;i++)
+            {
+                cout<<a[i]<<" ";
+            }
+        }
+        else
+        {
+            vector<int> v;
+            for(int i=0;i<n;i++)
+            {
+                if(a[i]!=-1)
+                v.push_back(a[i]);
+
+            }
+
+            sort(v.begin(),v.end());
+            int last=v[v.size()-1];
+            int g=0;
+            for(int i=0;i<n;i++)
+            {
+                if(a[i]==last&&g==0)
+                {
+                    a[i]=-a[i]-1;
+                    g=1;
+                }
+
+                cout<<a[i]<<" ";
+            }
+        }
+
+    }
+    else
+    {
+        if(n%2==0)
+        {
+            for(int i=0;i<n;i++)
+            cout<<a[i]<<" ";
+        }
+        else
+        {
+            cout<<0<<" ";
+            for(int i=1;i<n;i++)
+            cout<<a[i]<<" ";
+        }
+    }
+}

DIV2C.cpp

@@ -0,0 +1,69 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main()
+{
+    long long int n,q;
+    cin>>n>>q;
+
+    long long int a[n];
+    for(int i=0;i<n;i++)
+    cin>>a[i];
+
+    long long int find1[n];
+    long long int max1=a[0];
+
+    long long int maxi=0;
+    long long int maxe=a[0];
+
+    for(int i=0;i<n;i++)
+    {
+        max1=max(max1,a[i]);
+        find1[i]=max1;
+
+        if(a[i]>maxe)
+        {
+            maxe=a[i];
+            maxi=i;
+        }
+    }
+int b[n];
+copy(a,a+n,b);
+ for(int i=0;i<maxi;i++)
+    {
+        if(b[i]>b[i+1])
+        {
+            int temp=b[i];
+            b[i]=b[i+1];
+            b[i+1]=temp;
+      }
+      }
+    vector<long long int> v;
+    for(int i=(maxi+1)%n;i!=maxi;i=(i+1)%n)
+    {
+        v.push_back(b[i]);
+    }
+
+    long long int m;
+
+
+    //for(int j=0;j<v.size();j++)
+    //cout<<v[j]<<" ";
+    while(q--)
+    {
+        cin>>m;
+
+        if(m<=maxi)
+        {
+            cout<<find1[m-1]<<" "<<a[m]<<"\n";
+        }
+        else
+        {
+            m=m-maxi-1;
+            m=(m%(n-1));
+            cout<<maxe<<" "<<v[m]<<"\n";
+        }
+    }
+
+}

DIV3B.cpp

@@ -0,0 +1,41 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main()
+{
+    int t;
+    cin>>t;
+    while(t--)
+    {
+        int n;
+        cin>>n;
+        int a[n];
+        int m0=0,m1=0,m2=0;
+        for(int i=0;i<n;i++)
+        {
+            cin>>a[i];
+            if(a[i]%3==0)
+            m0++;
+            else if(a[i]%3==1)
+            m1++;
+            else
+            m2++;
+
+
+        }
+
+        if(m1>m2)
+        {
+            m1=m1-m2;
+            cout<<m0+m2+m1/3<<"\n";
+        }
+        else
+        {
+            m2=m2-m1;
+            cout<<m0+m1+m2/3<<"\n";
+        }
+
+
+    }
+}

GUI2

@@ -0,0 +1,53 @@
+#include <bits/stdc++.h>
+#include <algorithm>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+#define ass 1e18
+#define MOD 1000000007
+#define mp make_pair
+#define pb push_back
+#define fi first
+#define se second
+#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define debug(x) cout << #x << ": " << x << endl;
+#define debug2(x,y) cout<<#x<<": "<< x<< ", "<< #y<< ": "<< y<< endl;
+#define debug3(x,y,z) cout<<#x<<": "<< x<< ", "<< #y<< ": "<< y<<" "<<#z<<" : "<<z<< endl;
+using namespace std;
+typedef long long int ll;
+#include <ext/pb_ds/assoc_container.hpp> 
+#include <ext/pb_ds/tree_policy.hpp> 
+using namespace __gnu_pbds;   
+#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
+ll arr[200005];
+
+int main()
+{
+	boost
+	ll t,ans,e1,e2,o1,o2,a,n,m,i;
+	cin>>t;
+	while(t--)
+	{
+		cin>>n;
+		e1=0;o1=0;e2=0;o2=0;
+		for(i=0;i<n;i++)
+		{
+			cin>>a;
+			if(a%2==0)
+				e1++;
+			else
+				o1++;
+		}
+		cin>>m;
+		for(i=0;i<m;i++)
+		{
+			cin>>a;
+			if(a%2==0)
+				e2++;
+			else
+				o2++;
+		}
+		ans=e1*e2+o1*o2;
+		cout<<ans<<"\n";
+	}
+	return 0;
+}

General.md

@@ -0,0 +1 @@
+General details.