hehe !我还以为我来帮你做呢,那些人做的比我还好!我都不好意思贴出来了,你是不是也是才学的呀,我也是.那些题都是最近才学过.还是自己做吧!有收获!/*编写一个求三角形面积的C++函数*/#include "iostream.h"#include "math.h"void main(){ double a,b,c,s; double area; cout>a>>b>>c; s=(a+b+c)/2; area=sqrt(s*(s-a)*(s-b)*(s-c)); cout#includedouble TriangleArea(double a,double b,double c){ double s=(a+b+c)/2;return sqrt(s*(s-a)*(s-b)*(s-c));}; void main(){double a,b,c; cout>a>>b>>c; cout class Queue{ private:int rear,front;Type *elements;int maxSize;
public:Queue(int sz=10);~Queue() {delete[] elements; }void EnQueue(const Type& item);intDeQueue();Type GetFront();void MakeEmpty() {front=rear=0;}int IsEmpty() const {return front==rear;}int IsFull() const {return (rear+1)%maxSize==front; }int Length() const {return (rear-front+maxSize)%maxSize; }void Transfer();};template Queue::Queue(int sz):front(0),rear(0),maxSize(sz){ elements=new Type[maxSize]; assert(elements!=0);}templatevoid Queue::EnQueue(const Type& item) { assert(!IsFull()); rear=(rear+1)%maxSize; elements[rear]=item;}templateint Queue::DeQueue() { if (IsEmpty())return 0; front=(front+1)%maxSize; return 1;}templateType Queue::GetFront() { if (IsEmpty())return NULL;
return elements[(front+1)%maxSize];}templatevoid Queue::Transfer() { if (!IsEmpty()){ cout<<"ê?3??óáD?a??￡o"<<endl;
int p;
p=(front+1)%maxSize;
while (p!=rear) {cout<<elements[p]<<" , "; p=(p+1)%maxSize;}
cout<<elements[rear]<<endl; }}
|
