1.

public:
void area(T a)
{
cout<<float(1.732*a*a)/4<<endl;
}
void area(T a,T b)
{
cout<<0.5*a*b<<endl;
}
void area(T a,T b,T c)
{
T s;
float e;
s=(a+b+c)/2;
e=pow(s*(s-a)*(s-b)*(s-c),0.5);
cout<<e<<endl;
}
};

2.

int n;
cin>>n;
list<int> l;
int num;
for(int i=0;i<n;i++)
{
cin>>num;
l.push_back(num);
}
int min,max;
cin>>min>>max;
int mi,ma;
list<int>::iterator it,it1;
it=min_element(l.begin(),l.end());
mi=*it;
l.insert(it,min);
it1=max_element(l.begin(),l.end());
ma=*it1;
l.insert(it1,max);

cout<<mi<<endl<<ma<<endl;

for(it=l.begin();it!=l.end();it++)
cout<<*it<<" ";
cout<<endl;
reverse(l.begin(),l.end());
for(it=l.begin();it!=l.end();it++)
cout<<*it<<" ";
cout<<endl;
l.sort();
for(it=l.begin();it!=l.end();it++)
cout<<*it<<" ";

3.

// You are using GCC

void operate(vector<int> v,int n)
{
vector<int> v1(n);
int j=0,flag=0;
for(int i=n-1;i>=0;i--)
{
v1[j]=v[i];
j++;
}
for(int i=0;i<n;i++)
{
if(v[i]!=v1[i])
{
flag=1;
break;
}
}
for(int i=n-1;i>=0;i--)
cout<<v[i]<<" ";
cout<<endl;
if(flag==1)
{
 cout<<"NOT EQUAL";
}
else
{
cout<<"EQUAL";
}
}

4.

void compute(int n,int arr[100],set<int> s)

{
for(int i=0;i<n;i++)
s.insert(arr[i]);
set<int>::iterator it;
int count=0;
for(it=s.begin();it!=s.end();it++)
{
cout<<*it<<" ";
if(*it<40)
count++;
}
cout<<endl<<count;
}

5.

int n;
X2 t,avg1;
X2 a[100];
public:
void enter()
{
cout<<"Enter the numbers of data:"<<endl;
cout<<"Enter number:"<<endl;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
}
 void total()
{
t=0;
for(int i=0;i<n;i++)
t=t+a[i];
cout<<"total sum of numbers is :"<<t<<endl;

}
void avg()
{
avg1=(float)t/n;
cout<<"Average = "<<avg1<<endl;
}
void sort()
{
cout<<"Elements of array in sorted ascending order:"<<endl;
for(int i=0;i<n-1;i++)
{
for(int j=0;j<n-i-1;j++)
{
if(a[j]>a[j+1])
{
int temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
for(int i=0;i<n;i++)
cout<<a[i]<<endl;
}
};

6.

int n;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++)
cin>>v[i];
int ele;
cin>>ele;
cout<<"Enter the size of array:\n";
cout<<"enter elements of array:\n";
print(v);
for(int i=0;i<n-1;i++)
{
for(int j=0;j<n-i-1;j++)
{
if(v[j]>v[j+1])
{
int temp=v[j];
v[j]=v[j+1];
v[j+1]=temp;
}
}
}
print(v);
reverse(v.begin(),v.end());
print(v);
cout<<"enter element you want to search:\n";
int flag=0;
for(int i=0;i<n;i++)
{
if(v[i]==ele)
{
flag=1;
cout<<"Found";
break;
}
}
if(flag==0)
cout<<"not found";
return 0;
}

7.

// You are using GCC

int n;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++)
cin>>v[i];
int ele;
cin>>ele;
cout<<n<<endl;
print(v);
reverse(v.begin(),v.end());
print(v);
cout<<"enter element you want to search:\n";
int flag=0;
for(int i=0;i<n;i++)
{
if(v[i]==ele)
{
flag=1;
cout<<"the number "<<ele<<" is in the list";
break;
}
}
if(flag==0)
cout<<"the number "<<ele<<" is not in the list";
return 0;
}
void print(vector<int> & v) {
for (vector<int>::iterator iter = v.begin(); iter != v.end(); ++iter) {
cout << *iter << " ";
}
cout << endl;
}

8.

9.

// You are using GCC

void s_name::insert_word()
{
int n;
string num;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>num;
v.push_back(num);
}
}
void s_name::delete_word()
{
string str;
cin>>str;
int n=v.size();
for(t=v.begin();t!=v.end();t++)
{
if(*t==str)
{
remove(v.begin(),v.end(),str);
v.resize(n-1);
break;
}
}

}
void s_name::replace_word()
{
string str,str1;
cin>>str>>str1;
replace(v.begin(),v.end(),str,str1);
}
void s_name::display()
{
if(v.size()==0)
cout<<"listempty";
else
{
for(t=v.begin();t!=v.end();t++)
cout<<*t<<endl;
}
}
10.

{
list<int>::iterator it;
for(it=l1.begin();it!=l1.end();it++)
{
*it=*it*2;
}
for(it=l1.begin();it!=l1.end();it++)
cout<<*it<<" ";
cout<<endl;
it=max_element(l1.begin(),l1.end());
cout<<*it;
cout<<endl;
it=min_element(l1.begin(),l1.end());
cout<<*it;
}

11.

{
int num;
for(int i=0;i<size;i++)
{
cin>>num;
l2.push_back(num);
}
list<int>::iterator it;
list<int> l1;
int i;
for(it=l2.begin(),i=0;it!=l2.end(),i<size/2;i++,it++)
{
if(*it%2==0)
l1.push_back(*it);
}
return l1;
}
void print(list<int> l)
{
list<int>::iterator it;
for(it=l.begin();it!=l.end();it++)
cout<<*it<<" ";
}

12.

int i,j;
for(i=0;i<m;i++)
{
for(j=0;j<m;j++)
{
if(arr2[i]==arr1[j])
{
cout<<arr1[j]<<" ";
}
}
}
}

13.

for(i=0;i<size;i++)
sum=sum+g1[i];
mean=(float)sum/size;
cout<<mean<<endl;
int temp;
for(i=0;i<size;i++)
{
temp=pow((mean-g1[i]),2);
sum1+=temp;
}
cout<<(float)sum1/size<<endl;
cout<<pow((float)sum1/size,0.5);
return 0;

14.
 sort_array(int s)
{
a=new T[s];
size=s;
}
void read()
{
for(int i=0;i<size;i++)
cin>>a[i];
for(int i=0;i<size-1;i++)
{
for(int j=0;j<size-i-1;j++)
{
if(a[j]>a[j+1])
{
T temp;
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
for(int i=0;i<size;i++)
cout<<a[i]<<endl;
}
};
int main()
{
int n;
cin>>n;
int choice;
sort_array<int> a(n);
sort_array<float> b(n);
sort_array<string> c(n);
cin>>choice;
switch(choice)
{
case 1:
a.read();
break;
case 2:
b.read();
break;
 case 3:
c.read();
break;
default:
cout<<"WRONG CHOICE";
}
return 0;
}

15.

int l=vec1.size();
for(int i=0;i<l-1;i++)
{
cout<<vec1[i]+vec1[i+1]<<endl;
}
}
int main()
{
int n;
cin>>n;
if(n==1)
{
cout<<"No Adjacent Value";
}
else
{
vector<int> v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
displaySum(v);
}
}

16.

int n;
cin>>n;
int num;
for(int i=0;i<n;i++)
{
cin>>num;
if(num==10)
{
int t=V.top();
V.pop();
V.push(10-t);
n++;

}
else
V.push(num);
}
n=V.size();
for(int i=0;i<n;i++)
{
cout<<V.top()<<endl;
V.pop();
}
return 0;
}

17.

int n;
cin>>n;
int num;
for(int i=0;i<n;i++)
{
cin>>num;
s.push(num);
}
for(int i=0;i<n;i++)
{
cout<<s.top()<<" ";

18.

void read()
 {
for(int i=0;i<size;i++)
cin>>a[i];
}
void sort1()
{
for(int i=0;i<size-1;i++)
{
for(int j=0;j<size-i-1;j++)
{
if(a[j]>a[j+1])
{
T temp;
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
}
void print()
{
for(int i=0;i<size;i++)
cout<<a[i]<<endl;
}
};

19.

class derived :public base

{
public:
derived()
{
area=w*l;
peri=2*(l+w);
cout<<area<<endl;
cout<<peri;
}
};

20.

void Paint::getdata()
{
cin>>l>>b>>h>>cost;
}
class Calculate:public Paint
{
long a1,a2,a;
public:
void total_cost()
{
// getdata();
a1=2*h*(l+b);
a2=l*b;
a=a1+a2;
cout<<a*cost;
}
};

21.

class Square_root:public puzzle

{
double c;
public:
double task1()
{
c=fun();
return pow(c,0.5);
}
operator double()
{

}
};
class Square:public puzzle
{
double d;
public:
double task2()
{
d=fun();
return pow(d,2);
}
operator double()
{

}
};

22.

23.

vendor::vendor()
{

}
void vendor::show_cust()
{
cin>>cust_id;
cin.ignore();
cin>>name;
cout<<cust_id<<endl;
cout<<name<<"\n";
}
class final:public vendor
{
public:
float p1,p2,q1,q2;
void show_total()
{
cin>>p1>>q1>>p2>>q2;
cout<<(p1*q1)+(p2*q2);
}
};

24.

void Triangle::get_bh()
{
cin>>base>>height;

}
class hypo:public Triangle
{
public:
int b,h;
void hyp()
{
get_bh();
b=base;
h=height;
// cout<<base<<height;
double d;
d=pow(base,2)+pow(height,2);
cout<<(int)pow(d,0.5)<<endl;
}
};
class Area:public hypo
{
public:
void get_Area()
{

hyp();
cout<<0.5*b*h;
}
};

25.

26.

void fun_try(int x,string n,string t,double cost)

{
if(x>0)
{
display(n,t);
cout<<fixed<<setprecision(2)<<(float)cost/x;
}
else
 cout<<"Days cannot be negative or zero";
}
void display(string n,string t)
{
cout<<n<<"\n"<<t<<"\n";
}

27.

class Onetier:public Train

{
public:
void get()
{
cin>>number_of_tickets>>price_per_ticket;
}
void bill()
{
int c=number_of_tickets*price_per_ticket;
if(c>5000)
{
cout<<c<<endl<<"Lucky customer you will get 20% discount. The modified bill for
Onetier is "<<c-(c*0.2)<<endl;
}
else
cout<<c<<endl;
}
};
class Twotier:public Train
{
public:
void get()
{
cin>>number_of_tickets>>price_per_ticket;
}
void bill()
{
int c;
c=number_of_tickets*price_per_ticket;
if(c>5000)
{
cout<<c<<endl<<"Lucky customer you will get 20% discount. The modified bill for
Twotier is "<<c-(c*0.2);
}
else
cout<<c;
}
};