全国计算机二级C++上机试题.doc

1改错#includeusing namespace std;class Dateint year;int month;int day;public:/ ERROR *found*Date(int yyyy, int mm, int dd):year(yyyy),month(mm),day(dd)bool isLaterThan(Date dt)const/当前日期晚于日期dt时返回trueif(year!=dt.year) return yeardt.year;if(month!=dt.month) return monthdt.month;return daydt.day;bool isEarlyThan(Date dt)const/当前日期早于日期dt时返回true if(year!=dt.year) return yeardt.year;if(month!=dt.month) return monthdt.month; / ERROR *found*return daydt.day;void showDate()constcoutyear年month月day日;/ ERROR *found*void compareDate( Date dt1, Date dt2)/constif(dt1.isLaterThan(dt2)dt1.showDate(); cout比; dt2.showDate(); cout更晚endl;else if(dt1.isEarlyThan(dt2)dt1.showDate(); cout比; dt2.showDate(); cout更早endl;elsedt1.showDate(); cout与; dt2.showDate(); cout是同一日期endl;int main()Date dt1(1958,3,23),dt2(2001,11,5);compareDate(dt1,dt2);compareDate(dt2,dt1);compareDate(dt2,dt2);return 0;2/ proj2.cpp#include using namespace std;const int MAXNUM = 100;class Set private:int num;/ 元素个数char setdataMAXNUM;/ 字符数组，用于存储集合元素public:Set(char *s); / 构造函数，用字符串s构造一个集合对象bool InSet(char c);/ 判断一个字符c是否在集合中，若在，返回true，否则返回falsevoid Print() const; / 输出集合中所有元素;Set:Set(char *s)num = 0;while (*s)/*found* if (InSet(*s)=false) / TODO: 添加代码，测试元素在集合中不存在/*found*setdatanum+=*s;/ TODO: 添加一条语句，加入元素至集合中s+;bool Set:InSet(char c)for (int i = 0; i num; i+)/*found* if (c=setdatai)/ TODO: 添加代码，测试元素c是否与集合中某元素相同/*found*return true;/ TODO: 添加一条语句，进行相应处理return false;void Set:Print() constcout Set elements: endl;for(int i = 0; i num; i+)cout setdatai ;cout endl;int main()char sMAXNUM;cin.getline(s, MAXNUM-1);/ 从标准输入中读入一行Set setobj(s);/ 构造对象setobjsetobj.Print();/ 显示对象setobj中内容return 0;3#include #include using namespace std;class IntArray public: IntArray(unsigned int n) size = n; data = new intsize; IntArray() delete data; int getSize() const return size; int& operator(unsigned int i) const return datai; void swap(int i, int j) int temp = datai; datai = dataj; dataj = temp; void sort(); friend ostream& operator (ostream &os, const IntArray &array) for (int i = 0; i array.getSize(); i+) os arrayi ; return os; private: int *data; unsigned int size;void readFromFile(const char*, IntArray&);void writeToFile(char *, const IntArray &);#include #include IntArray.hvoid IntArray:sort()/*333*for(int i=0;isize;i+) for (int j=i+1;jdataj) swap(datai,dataj); /*666*void readFromFile(const char* f, IntArray& m) ifstream infile(f); if (infile.fail() cerr mi+; int main() IntArray a1(3), a2(7), a3(1000); a10 = 3, a11 = 1, a12 = 2; a20 = 5, a21 = 2, a22 = 7, a23 = 4, a24 = 1, a25 = 6, a26 = 3; readFromFile(in.dat, a3); cout - 排序前 -n; cout a1 = a1 endl; cout a2 = a2 endl endl; a1.sort(); a2.sort(); a3.sort(); cout - 排序后 -n; cout a1 = a1 endl; cout a2 = a2 endl endl; writeToFile(, a3); return 0;模拟试题31/ proj1.cpp#include using namespace std;class MyClass public:/ ERROR *found*MyClass(int i=10) value = i; cout Constructor called. endl; / ERROR *found*MyClass(const MyClass& p) value=p.value; cout Copy constructor called. endl;void Print() cout The value is value endl; / ERROR *found*MyClass() cout Destructor called. endl; private:int value;int main()MyClass obj1;obj1.Print();MyClass obj2(obj1);obj2.Print();return 0;2#include using namespace std;class Sort public: Sort(int* a0, int n0) : a(a0), n(n0) virtual void mySort() = 0; static swap(int& x, int& y) int tmp = x;/*found* x=y; y = tmp; protected: int* a; int n;class InsertSort : public Sort public: InsertSort(int* a0, int n0)/*found* :Sort(a0,n0) virtual void mySort() for(int i = 1; i 0; -j) if(aj aj-1)/*found* swap(aj, aj-1) ; else /*found* break; ;void fun(Sort& s) s.mySort(); void print(int *a, int n) for(int i = 0; i n; +i) cout ai , ; cout endl