added april long challenge solutions

Author: ashcode07

CodeChef_problems/long_challenge/april_2020_div2/long20apr1.cpp

@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long int
+#define mod 1000000007
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+    cout.tie(nullptr);
+    int t ;
+    cin >> t ;
+    ll n;
+    while (t--) {
+        cin>>n;
+        vector<ll> vec;
+        ll z,profit=0;
+        for (ll i = 0; i < n; ++i) {
+            cin>>z;
+            vec.emplace_back(z);
+        }
+        sort(vec.begin(),vec.end(),greater<>());
+        profit+=vec[0];
+        for (ll j = 1; j < n; ++j) {
+            if(vec[j]-j>0)
+            profit+=(vec[j]-j);
+            else
+                break;
+        }
+        cout<<profit%mod<<"\n";
+    }
+    return  0;
+}
+
+

CodeChef_problems/long_challenge/april_2020_div2/long20apr2.cpp

@@ -0,0 +1,58 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long int
+#define mod 1000000007
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+    cout.tie(nullptr);
+    int t ;
+    cin >> t ;
+    ll n,z;
+    while (t--) {
+            cin>>n;
+            vector<ll> vec;
+            bool poss= false;
+            ll count=0;
+        for (ll i = 0; i <n ; ++i) {
+            cin>>z;
+            if(z==1)
+                count++;
+            vec.emplace_back(z);
+        }
+        ll prev=0,pos1=0;
+        if(count==1)
+            poss=true;
+        else
+       {
+            if(n>=6){
+            for (ll j = 0; j <n ; ++j) {
+                if(vec[j]==1){
+                    if(prev==0){
+                        prev=1;
+                        pos1=j;
+                    }
+                    else{
+                        if(j-pos1>=6)
+                        {
+                            poss=true;
+                            pos1=j;
+
+                        } else{
+                            poss= false;
+                            break;
+                        }
+                    }
+
+                }
+            }
+        }}
+        if(poss)
+            cout<<"YES\n";
+        else
+            cout<<"NO\n";
+    }
+    return  0;
+}
+
+

CodeChef_problems/long_challenge/april_2020_div2/long20apr3.cpp

@@ -0,0 +1,44 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long int
+#define mod 1000000007
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+    cout.tie(nullptr);
+    int t ;
+    cin >> t ;
+    ll x,k;
+    while (t--) {
+            cin>>x>>k;
+            unordered_map<ll,ll> umap;
+            ll n=x;
+        while (n % 2 == 0)
+        {
+           umap[2]++;
+            n = n/2;
+        }
+        for (ll i = 3; i <= sqrt(n); i = i + 2)
+        {
+            while (n % i == 0)
+            {
+                umap[i]++;
+                n = n/i;
+            }
+        }
+        ll sum=0;
+        if (n > 2)
+           umap[n]++;
+        for (auto part : umap){
+            sum+=part.second;
+        }
+        if(x>=pow(2,k)&&k<=sum)
+            cout<<"1\n";
+        else
+            cout<<"0\n";
+
+    }
+    return  0;
+}
+
+

CodeChef_problems/long_challenge/april_2020_div2/long20apr4.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+using  namespace std;
+#define ll long long int
+int main(){
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+    int t;
+    cin>>t;
+    ll n;
+     while (t--){
+        cin>>n;
+        if(n==1)
+            cout<<"1\n1 1\n";
+        else
+        {
+            cout<<n/2<<"\n";
+            if(n%2==0)
+                cout<<"2 1 2\n";
+            else
+                cout<<"3 1 2 "<<n<<"\n";
+            for (ll i = 3; i <n ; i+=2) {
+                cout<<"2 "<<i<<" "<<i+1<<"\n";
+            }
+        }
+    }
+    return  0;
+}

CodeChef_problems/long_challenge/april_2020_div2/long20apr5.cpp

@@ -0,0 +1,58 @@
+#include <bits/stdc++.h>
+using  namespace std;
+#define ll long long int
+ll sumArr(vector<ll>arr, ll n, ll sum)
+{
+    unordered_map<ll, ll> prevSum;
+
+    ll res = 0;
+
+    // Sum of elements so far.
+    ll currsum = 0;
+
+    for (ll i = 0; i < n; i++) {
+
+        currsum += arr[i];
+        if (currsum == sum)
+            res++;
+
+        if (prevSum.find(currsum - sum) !=
+            prevSum.end())
+            res += (prevSum[currsum - sum]);
+        prevSum[currsum]++;
+    }
+
+    return res;
+}
+int main(){
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+    int t;
+    cin>>t;
+    ll n,z;
+    ll count,mul,odd,even4,even;
+    while (t--){
+        cin>>n;
+        odd=0;even4=0;
+        even=0;
+        vector<ll> vec,arr;
+        ll total =(n*(n+1))/2;
+        for (ll i = 0; i <n ; ++i) {
+            cin >> z;
+//            vec.emplace_back(abs(z));
+            if(z%4==0)
+                arr.emplace_back(2);
+            else if(z%2==0)
+                arr.emplace_back(1);
+            else
+                arr.emplace_back(0);
+        }
+        for (ll j = 0; j <n ; ++j) {
+
+        }
+        ll minus=sumArr(arr,n,1);
+
+        cout<<total-minus<<"\n";
+    }
+    return  0;
+}

CodeChef_problems/long_challenge/april_2020_div2/long20apr6.cpp

@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+using  namespace std;
+#define ll long long int
+ll printRandoms(ll lower, ll upper)
+{
+       ll num = (rand() %(upper - lower + 1)) + lower;
+}
+int main(){
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+    int t;
+    cin>>t;
+    ll n,m,k;
+    while(t--){
+        cin>>n>>m>>k;
+        vector<vector<ll>> vec(n,vector<ll>(k,0));
+        for (ll i = 0; i <n ; ++i) {
+            vector<int> mp(m+1,1);
+            for (ll j = 0; j < k; ++j) {
+                cin>>vec[i][j];
+                mp[vec[i][j]]++;
+            }
+            sort(mp.begin(),mp.end(),greater<>());
+            int pos=distance(mp.begin(),max_element(mp.begin(), mp.end()));
+//                ll pos=printRandoms(1,m);
+                cout<< pos<<" ";
+        }
+        cout<<'\n';
+    }
+    return  0;
+}