1、 int age;how old are you:age;the age is age struct student int no; float math; ; int n;n; student wang; wang.no=n;wang.math;wang.no wang.mathplease input the length of the array: if(p=new intn)=0) cant allocate more memory, terminating exit(1); for(int i=0;ii+) pi=i*2;Now output the array: for(i=0;p
2、i delete p; pi=i*i+1;/* Note:Your choice is C IDE */#include float a=2.4; int a=8;a int num=50; int &ref=num; ref+=10;num=numref=ref num+=40;ref int num; num=5;&void swap(int &x,int &y); int x=5,y=6;before swap, x:x ,y:y swap(x,y);after swap, x:y;rx,int &ry) int t=rx; rx=ry; ry=t;/using namespace st
3、d;/* double radius;please input radius:radius; double result=radius*radius*3.14*4;The result is (double)resultradius*radius*3.14*4int array64=60,80,90,75,75,85,65,77,80,88,90,98,89,100,78,81,62,68,69,75,85,85,77,91;int &level(int grade,int size,int &tA,int &tB ); int typeA=0,typeB=0; int student=6;
4、int gradesize=4;student; level(arrayi,gradesize,typeA,typeB)+;number of type A is typeAnumber of type B is typeB=80) return tA; else return tB;float &fn2(float r) float t; t=3.14*r*r; return t; fn2(5.0)=12.4;fn2(5.0) string s,t;please input a zifuchuan:s; t=I like programming!zifuchuan output:endlst
5、s.append( OK!)inline double circumference(double radius); double r=3.0,s; s=circumference(r);the circumference is .inline double circumference(double radius) return 2*3.1415926*radius;int add(int x,int y) int sum; sum=x+y; return sum;int add(int x,int y,int z) sum=x+y+z; int a,b; a=add(5,10); b=add(
6、5,10,20);a=b=btemplateT min(T a,int n) int i; T minv=a0; for(i=1; if(minvai) minv=ai; return minv; int a=1,3,0,2,7,6,4,5,2; double b=1.2,-3.4,6.8,9.8; int c=1,9,5,-6,7,8;a de shuzu zhong min zhi wei:min(a,9)b de shuzu zhong min zhi wei:min(b,4)c de shuzu zhong min zhi wei:min(c,6)#define PI 3.141592
7、6535#define CS Circle_Squaredouble Circle_Square(T x) return x*x*PI;double Circle_Square(long x) int r1=1; double r2=2.0; long r3=3;The first cs is CS(r1)The second cs is CS(r2)The third cs is CS(r3) int i=0,&l=i,&k=l; i=+l-k;i=class Tdate public: void set(int,int,int); int isLeapYear(); void print(
8、); private: int month; int day; int year;void Tdate:set(int m,int d,int y) month=m;day=d;year=y;int Tdate:isLeapYear() return(year%4=0&year%100!=0)|(year%400=0);print()month/dayyearisLeapYear() Tdate x; x.set(10,23,2000); x.isLeapYear(); x.print(); ;void someFunc(Tdate& refs) refs.print(); if(refs.i
9、sLeapYear() coutprint(); if(*pTdate).isLeapYear() someFunc(s);void sphere(); sphere();void sphere() if(radius0) return;the result is const int SIZE=10;class Cstack char stkSIZE; int position; void init() position=0; char push(char ch); char pop();char Cstack:push(char ch) if(position=SIZE)栈满 return
10、0; stkposition+=ch; return ch;pop() if(position=0) n栈空 return stk-position; Cstack s; s.init(); char ch;please input some characters:ch; while(ch!=#s.push(ch)now output the data: while(ch=s.pop() void set(int m=5,int d=16,int y=1991) void print() Tdate a,b,c; a.set(4,12,1996); b.set(3); c.set(8,10);
11、 a.print(); b.print(); c.print();class cube int volume(int ht,int wd) return ht*wd; int volume(int ht,int wd,int dp) return ht*wd*dp; int ht,wd,dp; cube c;c.volume(10,20)c.volume(10,20,30)class queue/*默认私有*/ int q100; int sloc,rloc; queue(); void qput(int i); int qget();queue:queue() sloc=rloc=0;que
12、ue initializedvoid queue:qput(int i) if(sloc=100)queue is full return; sloc+; qsloc=i;int queue:qget() if(rloc=sloc)queue is empty rloc+; return qrloc; queue a,b; a.qput(10); b.qput(20); a.qput(20); b.qput(19);a.qget()b.qget()class test float f1; test(); test(int n,float f); int getint() return num; float getfloat() return f1;test:test()Initializing default num=0; f1=0.0;test(int n,float f)Initializingn,f num=n; f1=f; test x; test y(10,21.5); test *px=new test; test *py=new test(10,21.5); Tdate(int m=5,int d=16,int y=1990) pri