explanation of code

#include <bits/stdc++.h>

using namespace std;

int main() {
   int t;
   cin>>t;
   for(int i=0;i<t;i++){
       int n;
       cin>>n;
       int m=2*n;
       int arr[m];
       for(int j=0;j<m;j++){
           cin>>arr[j];
       }
       
       sort(arr,arr+m);
// meadian of array is in middle
//for 2n length middle is n-1 and n
       cout<<abs(arr[n-1]-arr[n])<<endl;
   }
     
}

explanation with code

github

#include <iostream>

using namespace std;

int main() {
   int t;
   cin>>t;
   for(int i=0;i<t;i++){
   int n;
   cin>>n;
   int arr[n];
   int zero=0;
   int sum=0;
   int total=0;
   for(int j=0;j<n;j++){
       cin>>arr[j];
       if(arr[j]==0){
           zero++;  // number of zero in array
       }
       sum=sum+arr[j]; //sum of array
   }  
   if(zero==0){ //no zero means product is non zero
       if(sum==0){
           cout<<"1"<<endl; 
       }
       else{
           cout<<"0"<<endl;
       }
   }
   else{
       total=zero;//add 1 to all zero element 
       sum=sum+zero;
       if(sum==0){
           cout<<total+1<<endl;
       }
       else{
           cout<<total<<endl;
       }
   }
   
   }
}

Solution explanation

github link:

#include <bits/stdc++.h>

using namespace std;

int main() {
   int t;
   cin>>t;
   int n;
   int sum;
   int odd;
   int even;
   
   for(int i=0;i<t;i++){
       cin>>n;
       sum=0;
       odd=0;
       even=0;
       int arr[n];
       for(int j=0;j<n;j++){
           cin>>arr[j];
           if(arr[j]%2!=0 || arr[j]==1){
               odd++;
           }else{
               even++;
           }
           sum+=arr[j];
       }
       
       if(sum%2!=0 || sum==1){
           cout<<"YES"<<endl;
       }
       else{
           if(odd!=0 && even!=0){
               cout<<"YES"<<endl;
           }
           else{
               cout<<"NO"<<endl;
           }
       }
   }
   
   
}

solution explannation part-1

part-2

GITHUB link [](https://github.com/nick-mehta/codeforces/blob/master/1294A%20codeforces%20problem.cpp)

`#include <bits/stdc++.h>

using namespace std;

int main() { int t; cin>>t; int a,b,c,n;

for(int i=0;i<t;i++){
    cin>>a>>b>>c>>n;



if(a==b && b==c){
    if(n%3==0){
        cout<<"YES"<<endl;
    }
    else{
        cout<<"NO"<<endl;
    }
}
else if (a==b && a>c){
    if(n>=a-c){
        n=n-(a-c);
        if(n%3==0){
            cout<<"YES"<<endl;
        }
        else{
            cout<<"NO"<<endl;
        }
    }
    else{
         cout<<"NO"<<endl;
    }
}

 else if (a==b && a<c){
    if(n>=(2*(c-a))){
        n=n-(2*(c-a));
        if(n%3==0 ){
            cout<<"YES"<<endl;
        }
        else{
            cout<<"NO"<<endl;
        }
    }
    else{
         cout<<"NO"<<endl;
    }
}

 else if (c==b && b>a){
    if(n>=b-a){
        n=n-(b-a);
        if(n%3==0){
            cout<<"YES"<<endl;
        }
        else{
            cout<<"NO"<<endl;
        }
    }
    else{
         cout<<"NO"<<endl;
    }
}

 else if (c==b && b<a){
    if(n>=(2*(a-b))){
        n=n-(2*(a-c));
        if(n%3==0){
            cout<<"YES"<<endl;
        }
        else{
            cout<<"NO"<<endl;
        }
    }
    else{
         cout<<"NO"<<endl;
    }
}

 else if (a==c && a>b){
    if(n>=a-b){
        n=n-(a-b);
        if(n%3==0){
            cout<<"YES"<<endl;
        }
        else{
            cout<<"NO"<<endl;
        }
    }
    else{
         cout<<"NO"<<endl;
    }
}

 else if (a==c && a<b){
    if(n>=(2*(b-a))){
        n=n-(2*(b-a));
        if(n%3==0){
            cout<<"YES"<<endl;
        }
        else{
            cout<<"NO"<<endl;
        }
    }
    else{
         cout<<"NO"<<endl;
    }
}

else{
    if(a>b && a>c){
        if(n>=(a-b)+(a-c)){
            n=n-(a-b)-(a-c);
            if(n%3==0){
                cout<<"YES"<<endl;
            }else{
                cout<<"NO"<<endl;
            }
        }else{
                cout<<"NO"<<endl;
            }

    }
    else if(b>a && b>c){
        if(n>=(b-a)+(b-c)){
            n=n-(b-a)-(b-c);
            if(n%3==0){
                cout<<"YES"<<endl;
            }else{
                cout<<"NO"<<endl;
            }
        }else{
                cout<<"NO"<<endl;
            }

    }
    else if(c>a && c>b){
        if(n>=(c-b)+(c-a)){
            n=n-(c-b)-(c-a);
            if(n%3==0){
                cout<<"YES"<<endl;
            }else{
                cout<<"NO"<<endl;
            }
        }else{
                cout<<"NO"<<endl;
            }

    }

}
}

}`

solution explanation

include

using namespace std;

int main() { int n; cin>>n; string s; cin>>s; int x=0; int y=0;

for(int i=0;i<n;i++){
    if(s[i]=='L'){
        x++;
    }else{
        y++;
    }
}

cout<<x+y+1<<endl;

}

here you can find solution of problem 1283 b candies division..

SOLUTION