3s.cpp~

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long int lg;

void sort1(lg,lg);
void sort2(lg,lg);
lg mila(lg,lg,lg);
lg a,b,n1,n2,x1,x2,n,cg=0;

lg a1[5999999]={0};
lg a2[5999999]={0};

int main()
{
 lg i,s1[99],s2[99],j,x,sm,cn;
 scanf("%lld%lld%lld",&n,&a,&b);

 n1=n/2;//pahle array ko hi likh  lelete hai n1 pahle array me members ki  count hai 
 n2=n-n1;
 for(i=0;i<n1;i++)
 scanf("%lld",&s1[i]);

 for(i=0;i<n2;i++)
 scanf("%lld",&s2[i]);//chalo dusra aarya inputees

 //For first array

 x1=pow(2,n1);
 
 
 for(i=0;i<x1;i++)
 {
   sm=0;

   for(j=0;j<n1;j++)
     if((i&(1<<j))>0)
       sm+=s1[j];
 
  a1[i]=sm;
          
 }

sort1(0,x1-1);

/*cout<<"Printtign first array\n";
for(i=0;i<x1;i++)
cout<<a1[i]<<"  ";
cout<<endl;
*///pahla arra complete

//for second array
 x2=pow(2,n2);
 sm=0;

 for(i=0;i<x2;i++)
 {
   sm=0;

   for(j=0;j<n2;j++)//bhai second array n1 se suru hokar n tak jaega
    if((i&(1<<j))>0)
     sm+=s2[j];
 
  a2[i]=sm;
          
 }

sort2(0,x2-1);

/*cout<<"Printtign first array\n";
for(i=0;i<x2;i++)
cout<<a2[i]<<"  ";
cout<<endl;
*///secod arry kahatam

//chalo ab tak dono aosrt hi gay

for(i=0;i<x1;i++)
 {
 
 mila(a1[i],0,x2-1);
 //cout<<cg<<endl;
 }
 printf("%lld\n",cg);
 
 return 0;
 
}      
  






lg mila(lg x,lg i,lg j)//bai dusre array me khoj rahe hai
{  lg m,s;
 //cout<<"\nKhoja ja raha hai\n";
 while(i<=j)
 {
 
  m=(i+j)/2;
  s=m;

   if(a2[s]+x < a)
      i=m-1;
    else if(a2[s]+x>b)
     j=m+1;     
   else
    {
      while( (a<=a2[s]+x)&&(a2[s]+x<=b)&&(s<x2) )
      { s++;
      cg++;}

      s=m-1;

      while( (a<=a2[s]+x)&&(a2[s]+x<=b)&&(s>=0) )
      { s--;cg++;
      }  

     }//end else
 
 
  }//end while

}  
























void sort1(lg l,lg r)
{
     lg p,i,j,temp;
     if(l<r)
     {
            i=l;j=r+1;
            p=a1[l];
            do{
                   do i++;
                   while(a1[i]<p && i<r);
                   
                   do j--;
                   while(a1[j]>p);
                   
                   if(i<j)
                   {temp=a1[i];
                   a1[i]=a1[j];
                   a1[j]=temp;
                   }
                   
                   }while(i<j);
                   
               temp=a1[l];
               a1[l]=a1[j];
               a1[j]=temp;
               sort1(l,j-1);
               sort1(j+1,r);
               }
               
               }


void sort2(lg l,lg r)
{
      lg p,i,j,temp;
     if(l<r)
     {
            i=l;j=r+1;
            p=a2[l];
            do{
                   do i++;
                   while(a2[i]<p && i<r);
                   
                   do j--;
                   while(a2[j]>p);
                   
                   if(i<j)
                   {temp=a2[i];
                   a2[i]=a2[j];
                   a2[j]=temp;
                   }
                   
                   }while(i<j);
                   
               temp=a2[l];
               a2[l]=a2[j];
               a2[j]=temp;
               sort2(l,j-1);
               sort2(j+1,r);
               }
               
               }