C++代码.docx

1、C+代码/计算器#includeusing namespace std;int main() float a,b,sum,r = 1; char c; coutplease enter num1, num2 and the char abc; if(c=+) sum = a+b; if(c=-) sum = a-b; if(c=*) sum = a*b; if(c=/) if(b =0) cout不符合运算规则endl; r = 0; if(r) coutsum = sumendl; return 0;/动态分布内存#includeusing namespace std;int main()

2、void all(int &,int &,float&,int p,int x); int m,n,min = 0,max = 0; float ave = 0; coutmn; int *p = new int m*n; coutplease enter m*nnumsendl; for(int i = 0;i*(p+i); all(min,max,ave,p,m*n); coutmin = minendlmax = maxendlave = aveendl; deletep; return 0;void all(int &min,int &max,float & ave,int p,int

3、 x) int i,sum = 0; min = p0; for(i=1;ix;i+) if(pimin) min = pi; max = p0; for(i=1;imax) max = pi; for(i = 0;ix;i+) sum = sum + pi; ave =(float) sum/x;/百钱问题#includeusing namespace std;/我算出共553种int main () int i,j,k,num =0; for(i=0;i=100;i+=5) if(i = 100) num+; for(j=0;j=100;j+=2) if(i+j=100) num+; fo

4、r(k=0;k=100;k+) if(i+j+k=100) num+; coutnumendl; return 0;/生日不相重的概率#include#include#includeusing namespace std;int main() int n,i,month365,day365,j,m,d,k,same = 0,num=0; float p1=1,p2; coutplease enter the num of the people:n; for(i=0;in;i+) p1 = p1 *(365-i)/365; / coutp1 = p1endl; for(j=0;jn;j+) sr

5、and(time(0); monthj = (rand()%12)+1; if(monthj = 1|3|5|7|8|10|12)/随机赋值n个人的生日 srand(time(0); dayj = rand()%31 + 1; /没做完不会做 if(monthj = 4|6|9|11) srand(time(0); dayj = rand()%30 + 1; if(monthj = 2) srand(time(0); dayj = rand()%28 + 1; return 0;#include /要用重载函数#include#include#includeusing namespace st

6、d;#define N 10void sort(int num, int );void sort(char s,int);void sort(char *s,int );int main() int numN,i; srand(time(0); for(i=0;iN;i+) numi = rand()%100 + 1; sort(num,N); for(i = 0;iN;i+) coutnumi,; coutendl; char sN; srand(time(0); for(i=0;iN;i+) si = rand()%26 + 65; sort(s,N); for(i = 0;iN;i+)

7、coutsi,; coutendl; char *name = Zates,Kongzi,Obama,Micky; sort(name,4); for(i=0;i4;i+) coutnamei,; coutendl; return 0;/冒泡法对数字排序void sort(int num,int n) int i,j,t; for(i=0;iN-1;i+) for(j=0;jnumj+1) t = numj; numj = numj+1;numj+1 = t; /冒泡法对字母排序/void sort(char s,int n) int i,j; char t; for(i=0;iN-1;i+)

8、 for(j=0;jsj+1) t = sj; sj = sj+1;sj+1 = t; /冒泡法对字符串排序/void sort(char *s,int n) int i,j; char * t; for(i=0;in-1;i+) for(j=0;j0) t = sj;sj = sj+1;sj+1 = t; 、/盒子问题#includeusing namespace std;class Boxprivate: float length,width,height;public: void set(); void pri() coutlength = length width = width he

9、ight = heightendl; float mianji(); float tiji() float v; v = length*width*height; return v; ;int main() Box a; float s,v ; a.set(); a.pri(); s = a.mianji(); coutmianji = sendl; v = a.tiji(); couttiji = vendl; return 0;inline void Box:set() coutPlease enter the length,width,height of the box:lengthwi

10、dthheight;float Box:mianji() float s; s = 2*(length*width + length*height + width*height); return (s);/创建日期的类#includeusing namespace std; /还没有写判断某天是星期几的函数/class Dateprivate: int year,month,day;public: void set(); void pri() coutmonth/day/yearendl; int whichday();/输入年月日并判断是否合理void Date:set() int t =

11、1; coutplease enter the year,month and day:yearmonthday; if(month12 | day1 | year31) t = 0; if(year%4=0 & year%100!=0) | year%400=0) if(month = 2 & day29) t = 0; else if(month = 2 & day28) t = 0; if(month = 4|6|9|11) & day30) t = 0; if(t) break; if(t = 0) coutthe date is impossible please enter agai

12、nendl; t = 1; /要将t还原为1 int Date:whichday() int num; num = (month-1)*31 + day;/先把所有的月都当做31天 if(month2) num = num - 1; else if(month2) num = num - 2; return num;int main() Date a; a.set(); a.pri(); int num = a.whichday(); coutnum = numendl; return 0;/定义一个学生的类#includeusing namespace std;/class Studentp

13、rivate: char name30; char sex; int age; long num;public: void set(); void pri();int main() Student a; a.set(); a.pri(); return 0;void Student:set() coutplease enter the students name sex age and num:namesexagenum;inline void Student:pri() coutname,sex,age,numendl;C+作业：实验3（改写复数类、集合类、链表类）/改写复数类#includ

14、eusing namespace std; class complex/定义类complex public: complex()/不带参数的构造函数 real=0;imag=0; complex(double x,double y)/带有参数的构造函数 real=x;imag=y; complex(complex&good1);/拷贝构造函数 complex() friend complex calculate(complex &a,complex &b,char c);/将此函数设为类complex的友元函数 friend void show(complex d)/将此函数设为类comple

15、x的友元函数 if(d.real0)coutd.real; else if(d.real0)coutd.real; if(d.imag=1)cout+iendl; else if(d.imag=-1)cout-i0)cout+d.imagiendl; else if(d.imag0)coutd.imagiendl; if(d.real=0&d.imag=0)cout0endl; private: double real; double imag; ; complex:complex(complex&good1) real=good1.real; imag=good1.imag; complex

16、 calculate(complex &a,complex &b,char c) complex d; if(c=+) d.real=a.real+b.real; d.imag=a.imag+b.imag; return d; else if(c=-) d.real=a.real-b.real; d.imag=a.imag-b.imag; return d; else if(c=*) d.real=a.real*b.real-a.imag*b.imag; d.imag=a.imag*b.real+a.real*b.imag; return d; else if(c=/&b.real!=0&b.

17、imag!=0) d.real=(a.real*b.real+a.imag*b.imag)/(b.real*b.real+b.imag*b.imag); d.imag=(a.imag*b.real-a.real*b.imag)/(b.real*b.real+b.imag*b.imag); return d; else couterrorendl; void main()/主函数 complex good1(1,-1),good2(-3,-2); show(calculate(good1,good2,+); show(calculate(good1,good2,-); show(calculat

18、e(good1,good2,*); show(calculate(good1,good2,/);/整型数集合类和实型数集合数类#includeclass floatset private: float set10; int num ; /集合中元素个数 public: floatset (int i=0)/集合初始化，输入i个元素值 int t; num=0; for(t=0;ti;t+,num+) coutsett; cout=9)break; void print( ); /打印集合中数据 float get(int i) ; /返回第i个元素值 void Set( int i , flo

19、at data); /设置第i个元素值为data friend class Intset;class Intset private: int set10; int num ; /集合中元素个数 public: Intset( int i =0 )/集合初始化，输入i个元素值 int t; num=0; for(t=0;ti;t+,num+) coutsett; cout=9)break; void print( ); /打印集合中数据 int get(int i) ; /返回第i个元素值 void Set( int i , int data); /设置第i个元素值为data void sett

20、ofloat(floatset &set2); /形参为拷贝的目标对象; void Intset:print( ) int t; for(t=0;tnum;t+) coutsett ; coutendl; int Intset:get(int i) return seti-1;void Intset:Set( int i , int data) seti-1=data;void Intset:settofloat(floatset &set) int t； for(t=0;tsett; set.num=num;void floatset:print( ) int t; for(t=0;tnum

21、;t+) coutsett ; coutendl;float floatset:get(int i) return seti-1;void floatset:Set( int i , float data) seti-1=data;void main() Intset a(3); a.print(); a.Set( 1 , 11); cout插入的元素为：a.get(1)endl ; cout修改后的集合为：; a.print(); floatset b(4); b.print(); b.Set( 1 , 11); cout插入的元素为：b.get(1)endl ; cout修改后的集合为：;

22、 b.print(); a.settofloat(b); cout将整型集合的元素拷贝到实型集合：; b.print();/链表类#include#include#include#include#define LEN sizeof(struct num)struct num/定义num结构体 int number; struct num * next;class lianbiao/定义链表类public: lianbiao()/构造函数 lianbiao()/析构函数 void creat();/产生随机数并赋给链表 void search(int b);/查询结点 void insert(int c);/插入结点 void out();/删除结点 void show();/输出链表 friend int sum(lianbiao &bb);/将求和函数设为友元private: static int n; struct num *pt;int lianbiao:n=0;void lianbiao: creat() struct num * head; struct num *p1,*p2; int i