Codechef April LOng Challenge Solutions

Author: anandsharma26

Codechef/31149629.cpp

@@ -0,0 +1,36 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        int arr[n];
+        for(int i=0;i<n;i++)cin>>arr[i];
+        int dist=0;
+        int prev=-6;
+        bool flag=true;
+        for(int i=0;i<n;i++){
+            if(arr[i]==1){
+                dist=i-prev;
+                prev=i;
+                if(dist<6){
+                    flag=false;
+                    break;
+                }
+            }
+        }
+        if(flag){
+            cout<<"YES"<<endl;
+        }
+        else cout<<"NO"<<endl;
+        
+        
+    }
+    
+    
+    
+}

Codechef/31151642.cpp

@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+# define mod 1000000007
+using namespace std;
+typedef long long int ll;
+int main() {
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        int arr[n];
+        for(int i=0;i<n;i++)cin>>arr[i];
+        sort(arr,arr+n);
+        ll sum=0;
+        for(int i=n-2;i>=0;i--){
+            if((arr[i]-(n-i-1))>=0)arr[i]-=(n-i-1);
+            else arr[i]=0;
+            
+        }
+        // for(int i=0;i<n;i++)cout<<arr[i]<<" ";
+        // cout<<endl;
+        for(int i=0;i<n;i++){sum=(sum+arr[i])%mod;}
+        
+        cout<<sum%mod<<endl;
+        
+    }
+    
+    
+    
+}

Codechef/31172796.cpp

@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long int ll;
+int main() {
+    ll t;
+    cin>>t;
+    while(t--){
+        ll x,k;
+        cin>>x>>k;
+        ll arr[1000000];
+        memset(arr,0,sizeof arr);
+        ll omega=0;
+        ll i=0;
+        while(x%2==0){
+              arr[i++]=2;
+              x=x/2;
+        }
+        
+        for (ll j=3;j<sqrt(x);j=j+2){
+            
+            while(x%j==0){
+                arr[i++]=j;
+                x=x/j;
+            }
+        }
+        
+        if(x>2)arr[i++]=x;
+        
+        
+        if(i>=k)cout<<"1"<<endl;
+        else cout<<"0"<<endl;
+        
+    }
+    
+}

Codechef/31575389.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+    int t;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n;
+        int days;
+        if(n==1){
+            cout<<"1\n"<<"1 "<<"1\n";
+        }
+       else{
+           days=n/2;
+           cout<<days<<"\n";
+           for(int i=1;i<=n;i+=2){
+           if(n%2==1&&i==1){cout<<"3 1 2 3\n";i+=1;}
+            else{cout<<"2 "<<i<<" "<<i+1<<"\n";}
+           
+           }
+       }
+    }
+    
+    
+    return 0;
+}

Codechef/31662600.cpp

@@ -0,0 +1,48 @@
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long int ll;
+int main() {
+    int t;
+    cin>>t;
+    while(t--){
+        int n,k,m;
+        cin>>n>>m>>k;
+        int arr[n][k];
+        int freq[n][m];
+        memset(freq,0,sizeof freq);
+        for(int i=0;i<n;i++){for(int j=0;j<k;j++){cin>>arr[i][j];}}
+        
+        int out[n];
+        for(int i=0;i<n;i++){
+            for(int j=0;j<k;j++){
+                freq[i][arr[i][j]-1]++;
+            }
+        }
+        
+         
+        
+        // for(int i=0;i<n;i++){
+        //     for(int j=0;j<m;j++){
+        //         cout<<freq[i][j]<<" ";}cout<<endl;}
+        
+        
+        for(int i=0;i<n;i++){
+            int max_index=0;
+            int max_option=0;
+            for(int j=0;j<m;j++){
+                if(freq[i][j]>max_option){
+                    max_option=freq[i][j];
+                    max_index=j+1;
+                }
+            }
+            out[i]=max_index;
+            
+        }
+      
+        
+        
+        for(int i=0;i<n;i++){cout<<out[i]<<" ";}
+        cout<<endl;
+    }
+    
+}

Codechef/31695056.cpp

@@ -0,0 +1,46 @@
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long int ll;
+
+int main() {
+    int t;
+    cin>>t;
+    while(t--){
+        ll n;
+        cin>>n;
+        ll arr[n];
+        for(ll i=0;i<n;i++)cin>>arr[i];
+        
+        ll new_arr[n];
+        for(ll i=0;i<n;i++){
+            if(arr[i]%2==1||arr[i]%2==-1){new_arr[i]=0;}
+            else if(arr[i]%4==0){new_arr[i]=4;}
+            else{new_arr[i]=1;}
+        }
+        //for(int i=0;i<n;i++)cout<<new_arr[i]<<" ";
+        //cout<<endl;
+        ll result=0;
+        ll cumsum=0;
+        unordered_map<ll,ll> sum;
+        
+        
+        
+        for(ll i=0;i<n;i++){
+            cumsum+=new_arr[i];
+            if(cumsum==1){;result++;}
+            if(sum.find(cumsum-1)!=sum.end()){
+
+                result+=(sum[cumsum-1]);
+            }
+            
+            sum[cumsum]++;
+        }
+        //cout<<result<<endl;
+        ll total=(n*(n+1))/2;
+        //cout<<total<<endl;
+        ll final=total-result;
+        cout<<final<<endl;
+       
+    }
+    
+}