class Super
{
    private Super()
    {
        
    }
}
class Sub extends Super
{
    
}

bool isFound(int[] array,int arraySize, int key)
{
  // write your search code in here
  for(int i=0;i<arraySize;i++)
   if(array[i] == key) return true;

  return false;
}

int main()
{
   int key = 123; //assume u have 123 to search for
   //you have two arrays array1,array2
   bool inArray1 = isFound(array1,array1Size,key);

#include<iostream>
using namespace std;

int main()
{
  long quo = 24 * 60 * 60 * 1000;
  long div = 24 * 60 * 60 * 1000*1000;

  cout<<div/quo;
}

#include<iostream>

using namespace std;

typedef struct ref
{
  unsigned int i:4;
  unsigned int j:2;
};

int main()
{
   ref r1;
   cout<<sizeof(r1)<<endl;
   r1.j = 3; //since r1 is 2 bits, max value is "11"(binary) or 3
   cout<<"Value of r1.j(2 bits)"<<r1.j<<endl;