全国计算机等级考试二级C++机试题.docVIP

机试试题一： 1.递归求斐波那契数列： #includeiostream.h const int N=8; long Fibo(int n); void main() { long f=Fibo(N); coutfendl; } long Fibo(int n) { if(n==1) return 1; if(n==2) return 1; return Fibo(n-1)+Fibo(n-2); } 注意：递归时用return返回，而不是用表达式 综合应用： #includeiostream.h const double pi=3.1416; class circle { protected: double r; double area; public: circle(){r=0;} circle(double radius){r=radius;} void print() { area=r*r*pi; coutr=r area=areaendl; } }; class column:protected circle { protected: double h; public: column(double radius,double height):circle (radius) 注意如何赋值给基类 { h=height; } void print() { circle::print(); 调用基类成员函数 couth=hvol=h*areaendl; } }; void main() { column col(1.0,2.0); col.print(); } 机试四： #includeiostream.h #includestring.h char*append(char*s1,char*s2) { char*apt; int length=strlen(s1)+strlen(s2); apt=new char[length+1]; strcpy(apt,s1); strcat(apt,s2); return apt; } void main() { char*s,*s1,*s2; s1=this is; s2=a string.; s=append(s1,s2); coutsendl; } #includeiostream.h class T { public: T(int x):a(x) { b+=x; } static void display(T c) { couta=c.ab=c.bendl; } private: const int a; static int b; }; int T::b=5; void main() { T A(3),B(5); T::display(A); T::display(B); } 机试六： #includeiostream.h class csample { int i; public: csample(){coutconstructor1endl;i=0;} csample(int val){coutconstructor2endl;i=val;} ~csample(){coutDestructorendl;} void disp(); }; void csample::disp() 注意 { couti=iendl; } void main() { csample *a,b(10); a=new csample; 注意 a-disp(); b.disp(); } 机试七 int charnum(char fn[10]) { fstream file; file.open(fn,ios::in); if(!file) { coutcannot open file!; abort(); } char ch; int count=0; while(!infile.eof()) { infile.get(ch); count++; } infile.close(); return count-1; } 算法：两数之积除以最大公约数所得的值即为最小公倍数 ?????gcd(?int?m,?int?n) ?????????????{ ??????????????????int?t,r; ??????????????????if(mn)?{t=m;?m=n;?n=t;} ??????????