C经典程序代码大全
cout<<"------------------"< < cout<<"pi="< else if (score>=70) cout<<"Your grade is a C."< else if (score>=60) cout<<"Your grade is a D."< else cout<<"Your grade is a E."< } #include <> main() { int n; cout<<"n="; cin>>n; if (n>=0 && n<=100 &&n%2==0) cout<<"n="< else cout<<"The "< #include <> main() { int a,b,Max; .10 for(int i=1;i<=10;i++) cout< cout< .1 for(int j=10;j>=1;j--) cout< cout< .9 for(int k=1;k<=10;k=k+2) cout< cout< .Z for(char c='A';c<='Z';c++) cout< cout< . for(float x=0;x<=;x=x+ cout< cout< for(float x1=0;x1<=+2;x1=x1+ cout< cout< .+100 int s=0; for(int n=1;n<=100;n++) s=s+n; cout<<"s="< } #include<> main() { .+100 int s=0,n=1; while(n<=100) { s=s+n; n++; } cout<<"s="< .+100 int s=0,n=0; do { n++; s+=n; }while(n<100); cout<<"s="< um; cin>>st[i].name; cin>>st[i].maths; cin>>st[i].physics; cin>>st[i].chemistry; } otal=st[i].maths+st[i].physics+st[i].chemistry; um<<'\t'; cout< cout< cout< cout< cout< } } #include<> main() { ame="<<(*p).name< cout<<"(*p).sex="<<(*p).sex< cout<<"(*p).age="<<(*p).age< cout<<"p->name="< cout<<"p->sex="< cout<<"p->age="< ame; cout<<"sex:"; cin>>(*p).sex; cout<<"age:"; cin>>(*p).age; ame="<<(*p).name< cout<<"(*p).sex="<<(*p).sex< cout<<"(*p).age="<<(*p).age< cout<<"-------------------------"< ame<<'\t'; cout< cout< } cout<<"----------------"< ; int int_values[] = {51, 23, 2, 44, 45,0,11}; float float_values[] = {, , , , }; student st_arr[]={101,"WangLin",92,102,"LiPing",85,103,"ZhaoMin",88}; um<<" "; cout< cout< } } #include<> otal swap_Rec(&a[i],&a[j]); <<"\t"< } #include<> void disp(void); < } #include<> < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); um; cin>>st[i].name; cin>>st[i].grade; fprintf(fp1,"%d %s %f\n",st[i].num,st[i].name,st[i].grade); } fclose(fp1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); < cout<<"Exiting program."< exit(1); */ putc( 'A', stdin ); if( ferror( stdin ) ) { perror( "Write error" ); clearerr( stdin ); } /* See if read causes an error. */ printf( "Will input cause an error? " ); c = getc( stdin ); if( ferror( stdin ) ) { perror( "Read error" ); clearerr( stdin ); } } #include<> #include<> < for (i=1; i<=MAX; i++) { cin>>x; (x); } < } void push(float x) < for (i=1; i<=MAX; i++) { cin>>x; (x); } < } void push(float x) < } ~stack(void) << endl; << endl; } << endl; isp_count(); delete p; (); } #include<> << endl; } ~ex_class() { cout << "The Object destroyed." < void set_value(int n); void show_val(char *name); } ; < } #include<> um :"; cout< } }; um :"; cout<<< } um="< } public: um="; cout<<< } how_value("(*p)obj2"); al="< DispFirst(); } }; < } virtual void aFn2(void) { cout<<"aFn2 is in Base class."< } < } }; < } < < } < < } void aFn2(void) { cout<<"aFn2 is in First derived class."< }; < } void aFn2(void){ cout<<"aFn2 is in Second derived class."< }; ; cout<<"s1: "< cout<<"s2: "< 10.2f10.5f; cout<<"String: "< cout<<"p : "< } #include<> #include <> ; int n; 1.7320534f << endl; } ~stack(void) { cout << "Stack Destroyed." << endl; } void push(T); T pop(void); }; << endl; return; } stck[tos++] = i; } template { if(tos==0) { cout << "Stack underflow." << endl; return 0; } return stck[--tos]; } irst; cout<<","<<(*theIterator).second<<" "; } cout< irst; cout<<","<<(*theIterator).second<<" "; } cout< irst; cout<<","<<(*it).second<<" "; } cout< econd << " "; else cout << "[err] "; } cout << endl; } } #include #include #include using namespace std; econd; cout<<"\t"<<(*theIterator).first< econd; cout<<"\t"<<(*i).first< } econd; cout<<"\t"<<(*it).first< } econd; cout<<"\t"<<(*i).first< } } #include #include #include <> using namespace std; #define ARRAY_SIZE 3 .入栈 for (i=0;i<10;i=i+2) (i); if (!()) { cout << "()=20;" << endl; ()=20; } //弹出栈中所有的数据并显示 cout<<"stack1: "; while (!()) { cout<<()<<" "; (); } cout< } #include #include #include using namespace std; //创建一个list容器的实例LISTINT，其存放int型数据typedef list void main(void) { //用LISTINT创建一个名为listOne的list对象 LISTINT listOne; //指定i为迭代器变量 LISTINT::iterator i; LISTINT::reverse_iterator ir; //从前面向listOne容器中添加数据 (2); (1); //从后面向listOne容器中添加数据 (3); (4); //从前向后显示listOne中的数据 for (i = (); i != (); ++i) cout << *i << " "; cout << endl; //从后向后显示listOne中的数据 for (ir =();ir!=(); ++ir) cout << *ir << " "; cout << endl; //从键盘上输入数据 for (i = (); i != (); ++i) { cout<<"listOne :"; cin>>(*i); } //从前向后显示listOne中的数据 for (i = (); i != (); ++i) cout << *i << " "; cout << endl; //bidirectional迭代器不允许加减运算 // i=()+1; } #include #include #include #include #include #include using namespace std; //利用类模板生成类实例 typedef vector < int > IntArray; typedef list typedef set int add(int a, int b) { return a+b; } //在main()函数中测试accumulate算法 void main () { //--------------------------------------------// accumulate算法对于普通数组的计算 //--------------------------------------------- int x[]={1,3,5,7,9}; cout<<"x[]:"; for (int i=0;i<5;i++) cout< cout< cout<<"accumulate(x,x+5,0)="; cout< int val=100; cout<<"val="< cout<<"accumulate(x,x+5,val)="; cout< //--------------------------------------------// accumulate算法对于vector容器的计算 //--------------------------------------------- //声明intvector容器和迭代器ii IntArray intvector; IntArray::iterator ii; //向intvector容器中插入元素 for (i=1; i<=5; i++) { (i); }; //显示intvector容器中的元素值和累加结果 cout << "intvector: "< for (ii=();ii !=();++ii) cout<<(*ii)<<" "; cout<