Silence的程序实验室

#include #include struct Snow/*雪的一些参数*/{int x;int y;int speed;}snow[100];int snownum=0;/*雪的个数*/int size;/*保存区域的大小*/int change=10;/*变颜色有关*/void *save1,*save2;/*保存空间*/void Copy();/*保存区域*/vo

#include #include #include #include #include #define MAX 1000 #define N 30 using namespace std; typedef list LISTINT; int main() { LISTINT::iterator iter; int a

//插入排序 int SertSort(int a[]){ int low,high,mid,i,j; for(i=2;i<=n;i++) if(a[i]<a[i-1]){ a[0]=a[i]; a[i]=a[i-1]; for(j=i-2;a[0]<a[j];j--) a[j+1]=a[j]; a[j+1]=a[0]; }

#includeusing namespace std;void MatrixChainOrder(int *p,int (*m)[10],int (*t)[10],int length){ int n=length-1; int i,j,k,q,num=0; for(i=1;i<length;i++) { m[i][i]=0; } for(i=2;i<=n;i++) {

#include#define MaxSize 50typedef char ElemType;struct List{ ElemType list[MaxSize]; int size;}setnull(struct List *p)//置空{ p->size=0;}int length(struct List *p)//求长度{ return (p->size);

//快速排序void QucikSort(int a[],int low,int high){ int i=low,j=high,x=a[low],t; do{ while (a[j]>x && j>low)j--; while (a[i]<x && i<high)i++; if (i<=j){

//堆排序int HeapInsert(int s,int m){int i,j,r,t;r=a[s];for(i=2*s;i<=m;i*=2){ if(j<m && a[j]<a[j+1])j++; if(r>=a[j])break; a[s]=a[j]; s=j; } a[s]=r;} void HeapSort(int a[]){

第一种方案：#includeusing namespace std;class Juxing{public: Juxing(int Hwidth,int Hheight); ~Juxing() {} int GetWidth() { return width; } int GetHeight() { return height; } void S

#include #include #include #define Y_MAX 30#define X_MAX Y_MAX*3#define MAX_TIME Y_MAX*6main(void) { char sheet[X_MAX][Y_MAX]; int chosen_x = 0; int chosen_y

文件1，类的定义，point.h#include#define OK 1using namespace std;class Point{ public: Point(int xx,int yy) { X=xx; Y=yy; countP++; } Point(Point &p);//拷贝函数 ~Point() { count--; } int

#include#define OK 1using namespace std;struct complex{ double real; double imaginary;};int main(){ int a,b; double x,y; complex c1,c2; int add(int a,int b); double add(

#includeusing namespace std;enum weekday{ Sunday,Monday,Tuesday,Wednesday,Thursday,Firday,Saturday };int main(){ int i; weekday day=Tuesday; cout<<"day = "<<day<<endl; i=day;

#include#includeusing namespace std;int main(){ enum color{ red,yellow,blue,white,black }; enum color pri; int n,loop,i,j,k; n=0; for(i=red;i<=black;i++) for(j=r

#include#include#define OK 1using namespace std;class People{ public://外部接口 People(int NewNumber,char NewSex,string NewData,string NewID);//构造函数 People()//构造函数设置默认初始值 {

#include#include#define OK 1using namespace std;class Point{ public: Point(int xx=0,int yy=0) { X=xx; Y=yy; } int GetX() { return X; } int GetY() { return Y; } friend float

第一种方案：使用if……else和break,continue控制程序流程#include#includeusing namespace std;int main(){ char choose,ch; while(1) { cout<<"Menu: A(dd) D(elete) S(ort) Q(uit),Select one: ";

#includeusing namespace std;class Rectangle//构造Rectangle类{ public: //外部接口 Rectangle(int top,int left,int bottom,int right);//构造函数 ~Rectangle() {}

#includeusing namespace std;class Dog{ public: Dog(int Bage=0,int Bweight=5);//构造函数 ~Dog();//析构函数 int GetAge() { return Hage; } void SetAge(int age) { Hage=age; } int GetWeight()

#include#define OK 1using namespace std;class Tree{ public: Tree(int Ages) { ages=Ages; } ~Tree() {} void grow(int years) { ages+=years; } void age(); private: int

#include#includeusing namespace std;class Point{public: Point(int xx=0,int yy=0) { X=xx; Y=yy; } Point(Point &p);//拷贝函数 int GetX() { return X; } int GetY() { return Y; }priv

#include#define OK 1#define pi 3.14using namespace std;class Circle{ public: Circle(int radius) { Radius=radius; } Circle(Circle &C); ~Circle() {} int GetR() { return Radiu