程序设计基础实验报告汇总

《程序设计基础课程设计》实验报告班级：1303011：洪礼翔学号：所选题目：1_1, 1_2,2_4,3_2,3_4,4_2,5_1程序设计语言：c++程序设计平台：visual c++ 6.0日期：2014-4-5签名：第1_1题算法描述：比较两个文本文件并打印出它们第一个不相同的行（文件每行字符数不多于80）。

源程序：no1_1.cpp#include<iostream.h>#include<fstream.h>#include<stdlib.h>#include<string.h>void main(){fstream infile1,infile2;infile1.open("f1.txt",ios::in);infile2.open("f2.txt",ios::in);if(!infile1){cout<<"f1.txt can't open";abort();}if(!infile2){cout<<"f2.txt can't open";abort();}char s1[80],s2[80];while(!infile1.eof()&&!infile2.eof()){infile1.getline(s1,sizeof(s1));infile2.getline(s2,sizeof(s2));if(strcmp(s1,s2)){cout<<s1<<endl;cout<<s2<<endl;}}infile1.close();infile2.close();}测试数据（输入、输出）：第1_2题算法描述：文本文件num1.txt和num2.txt中各有一组用空格分隔的整数，将num1.txt和num2.txt联合排序，并将结果保存在num3.txt中源程序：no1_2.cpp#include<fstream.h>#include<iostream.h>#include<stdlib.h>#include<strstrea.h>int cmp(const void *m,const void *n);void main(){fstream inf1,inf2,outf;inf1.open("num1.txt",ios::in);if(!inf1){cout<<"num1.txt can't open.\n";abort();}inf2.open("num2.txt",ios::in);if(!inf2){cout<<"num2.txt can't open.\n";abort();}outf.open("num3.txt",ios::out);if(!outf){cout<<"num3.txt can't open.\n";abort();}int array[40]={0};int i=0;while(!inf1.eof()){inf1>>array[i++];}while(!inf2.eof()){inf2>>array[i++];}qsort(array,i,sizeof(int),cmp);int j(0);while(i){outf<<array[j++];if(i!=1) outf<<' ';i--;}cout<<"Sort correctlly!\n";}int cmp(const void *m,const void *n) {return *(int *)m-*(int *)n;}测试数据（输入、输出）：第2_4题算法描述：编写程序XMLtoTXT自动将XML文件email.xml转换为文本文件email.txt。

命令行格式：XMLtoTXT email.xml email.txt。

源程序：No2_4.cpp#include<iostream.h>#include<fstream.h>#include<string.h>#include<stdlib.h>void main(){fstream infile,outfile;infile.open("email.xml",ios::in);if(!infile){cout<<"email.xml can't open.\n";abort();}outfile.open("email.txt",ios::out);if(!outfile){cout<<"email.txt can't open.\n";abort();}char ch=0;int state=0;cout<<"Progressing......"<<endl;while((ch=infile.get())!=EOF){char str[10]={0};if(ch=='<'){for(int i(0);infile.peek()!='>';i++){str[i]=infile.get();}if(!strcmp(str,"from")) state=-1;if(state==-1&&!strcmp(str,"address")) state=1;if(!strcmp(str,"to")) state=-2;if(state==-2&&!strcmp(str,"address")) state=2;if(!strcmp(str,"subject")) state=3;if(!strcmp(str,"body")) state=4;if(state>0){switch(state){case 1:outfile<<"from:";break;case 2:outfile<<"to:";break;case 3:outfile<<"subject:";break;case 4:outfile<<"body:";break;default:cout<<"error!\n";exit(0);}state=0;infile.get();while(infile.peek()!='<'){infile.get(ch);outfile.put(ch);}outfile<<endl;}}}cout<<"Convert correctly!"<<endl;}测试数据（输入、输出）第3_2题算法描述：设计一个复数类型，输入实部和虚部生成一个复数，可进行两个复数求和、两个复数求差、两个复数求积运算。

源程序：No3_2.cpp#include<iostream.h>class complex{public:complex(){set(0.0,0.0);}complex(double real, double imag){set(real,imag);}void set(double r, double i){real=r;imag=i;}friend complex operator +(const complex &c1,const complex &c2);friend complex operator -(const complex &c1,const complex &c2);friend complex operator *(const complex &c1,const complex &c2);void print();private:double real, imag;};void complex::print(){if(imag<0)cout<<real<<imag<<"i"<<endl;elsecout<<real<<"+"<<imag<<"i"<<endl;}complex operator +(const complex &c1,const complex &c2) {return complex(c1.real+c2.real,c1.imag+c2.imag);}complex operator -(const complex &c1,const complex &c2) {return complex(c1.real-c2.real,c1.imag-c2.imag);}complex operator *(const complex &c1,const complex &c2) {return complex(c1.real*c2.real-c1.imag*c2.imag,c1.real*c2.imag+c1.imag*c2.real);}void main(){complex a,b,c;double r,i;cout<<"Complex a:\n";cout<<"Input real part:";cin>>r;cout<<"Input imaginary part:";cin>>i;a.set(r,i);cout<<"a=";a.print();cout<<"Complex b:\n";cout<<"Input real part:";cin>>r;cout<<"Input imaginary part:";cin>>i;b.set(r,i);cout<<"b=";b.print();int s;cout<<"Function:\n\n";cout<<"1.c=a+b 2.c=a-b 3.c=a*b\n"<<"Please enter a number:"; Input:cin>>s;switch(s){case 1: c=a+b;break;case 2: c=a-b;break;case 3: c=a*b;break;default:cout<<"Please enter '1','2'or'3'!\n";goto Input;}cout<<"\nc=";c.print();}测试数据（输入、输出）第3_4题算法描述：根据输入的数字N，计算N以（包括N）数据链并统计数据链末尾数字是1的数据个数。