代码
2-4
代码如下:
2.#include<iostream>
#include<cmath>
using namespace std;
template <typename T>
T power(T x,T y)
{
return pow(x,y);
}
int main()
{
int a,b;
float x,y;
cin>>x>>y;
a=x,b=y;
cout<<power(x,y)<<endl;
cout<<power(a,b)<<endl;
return 0;
}
3.#include<iostream>
using namespace std;
template <typename T>
T sum(T a[],int n)
{
T s=0;
for(int i=0;i<n;i++)
s=s+a[i];
return s;
}
int main()
{
int a1[3]={0,1,2};
float a2[3]={1.1,1.2,1.3};
double a3[3]={2.56,2.31,2.31};
cout<<sum(a1,3)<<'\t'<<sum(a2,3)<<'\t'<<sum(a3,3)<<endl;
return 0;
}
4.#include<iostream>
using namespace std;
template <typename T>
class CValue
{
T a[5];
public:
CValue(T b[5])
{
for(int i=0;i<5;i++)
a[i]=b[i];
}
T max()
{
T max=a[0];
for(int i=0;i<5;i++)
{
if(max<a[i]) max=a[i];
}
return max;
}
T min()
{
T min=a[0];
for(int i=0;i<5;i++)
{
if(min>a[i]) min=a[i];
}
return min;
}
};
int main()
{
int a1[5]={0},i=0;
float a2[5]={0};
double a3[5]={0};
for(i=0;i<5;i++)
cin>>a1[i];
for(i=0;i<5;i++)
cin>>a2[i];
for(i=0;i<5;i++)
cin>>a3[i];
CValue<int>c1(a1);
CValue<float>c2(a2);
CValue<double>c3(a3);
cout<<c1.max()<<'\t'<<c1.min()<<'\n'<<c2.max()<<'\t'<<c2.min()<<'\n'<<c3.max()<<'\t'<<c3.min()<<endl;
return 0;
}
5、6
代码如下:
5.#include<iostream>
using namespace std;
template <typename T>
class CValue
{
T a[5];
public:
CValue()
{
cout<<"请输入五个数:"<<endl;
for(int i=0;i<5;i++)
cin>>a[i];
}
friend T max(CValue<T> f);
friend T min(CValue<T> f);
};
template<typename T>
T max(CValue<T> f)
{
T max=f.a[0];
for(int i=0;i<5;i++)
{
if(max<f.a[i]) max=f.a[i];
}
return max;
}
template<typename T>
T min(CValue<T> f)
{
T min=f.a[0];
for(int i=0;i<5;i++)
{
if(min>f.a[i]) min=f.a[i];
}
return min;
}
int main()
{
CValue<int>c1;
CValue<float>c2;
CValue<double>c3;
cout<<max(c1)<<'\t'<<min(c1)<<'\n'<<max(c2)<<'\t'<<min(c2)<<'\n'<<max(c3)<<'\t'<<min(c3)<<endl;
return 0;
}
6.#include<iostream>
using namespace std;
template<typename T>
class CArray
{
T*a;
int size;
public:
CArray(T*array=NULL,int n=0)
{
size=n;
if(size>0)
{
a=new T[size];
for(int i=0;i<size;i++) a[i]=array[i];
}
else
a=NULL;
}
void show()
{
for(int i=0;i<size;i++)
cout<<a[i]<<'\t';
cout<<endl;
}
T sum()
{
T s=0;
for(int i=0;i<size;i++)
s=s+a[i];
return s;
}
void average()
{
cout<<"the average is:"<<sum()/size<<endl;
}
void max()
{
T max=a[0];
for(int i=0;i<size;i++)
if(max<a[i]) max=a[i];
cout<<"the max is:"<<max<<endl;
}
void min()
{
T min=a[0];
for(int i=0;i<size;i++)
if(min>a[i]) min=a[i];
cout<<"the min is:"<<min<<endl;
}
~CArray()
{
if(a) delete [] a;
}
};
int main()
{
int a1[3]={0},i=0;
float a2[6]={0};
double a3[5]={0};
for(i=0;i<3;i++)
cin>>a1[i];
for(i=0;i<6;i++)
cin>>a2[i];
for(i=0;i<5;i++)
cin>>a3[i];
CArray<int>c1(a1,3);
CArray<float>c2(a2,6);
CArray<double>c3(a3,5);
c1.show();
cout<<"the sum is :"<<c1.sum()<<endl;
c1.average();
c1.max();
c1.min();
c2.show();
cout<<"the sum is :"<<c2.sum()<<endl;
c2.average();
c2.max();
c2.min();
c3.show();
cout<<"the sum is :"<<c3.sum()<<endl;
c3.average();
c3.max();
c3.min();
return 0;
}
总结
如有帮助,还望点赞